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 - Forbidden - Document - PDFSEARCH.IO

First Page	Meta Content
	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 Document Date: 2016-02-04 05:53:37 Open Document File Size: 137,65 KB Share Result on Facebook

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 problAdd to Reading List