On the Complexity of Paths Avoiding Forbidden Pairs Petr Kolman and Ondˇrej Pangr´ac Abstract Given a graph G = (V, E), two fixed vertices s, t ∈ V and a set F of pairs of vertices (called forbidden pairs), the probl

First Page		Document Content
Date: 2016-02-04 05:53:37		On the Complexity of Paths Avoiding Forbidden Pairs Petr Kolman and Ondˇrej Pangr´ac Abstract Given a graph G = (V, E), two fixed vertices s, t ∈ V and a set F of pairs of vertices (called forbidden pairs), the probl Add to Reading List Source URL: iti.mff.cuni.cz Download Document from Source Website File Size: 137,65 KB Share Document on Facebook