On paths avoding forbidden pairs of vertices in a graph
From MaRDI portal
Publication:678872
DOI10.1016/S0166-218X(96)00017-0zbMath0878.68091MaRDI QIDQ678872
Publication date: 14 December 1997
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Related Items
Reachability in choice networks, The checkpoint problem, On the complexity of paths avoiding forbidden pairs, Domination problems with no conflicts, Analyzing the reachability problem in choice networks, Sorting with forbidden intermediates, Complexity of the path avoiding forbidden pairs problem revisited, Path problems in skew-symmetric graphs, Constrained hitting set problem with intervals
Cites Work