Shortest Paths Avoiding Forbidden Subpaths
From MaRDI portal
Publication:5389966
DOI10.4230/LIPIcs.STACS.2009.1831zbMath1236.68103OpenAlexW1504745067MaRDI QIDQ5389966
Publication date: 24 April 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_8793.html
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (4)
Proper‐walk connection number of graphs ⋮ The complexity of routing problems in forbidden-transition graphs and edge-colored graphs ⋮ Unnamed Item ⋮ Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves
This page was built for publication: Shortest Paths Avoiding Forbidden Subpaths