Shortest paths avoiding forbidden subpaths

DOI10.1002/net.21490zbMath1269.90086OpenAlexW2006429817MaRDI QIDQ5326797

Anna Lubiw, Mustaq Ahmed

Publication date: 6 August 2013

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2009/1831/

zbMATH Keywords

graph algorithmroad networkoptical networkDijkstraexception avoiding path

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Shortest paths with exclusive-disjunction arc pairs conflicts ⋮ Finding Paths in Grids with Forbidden Transitions

Cites Work

• The shortest path problem with forbidden paths
• An algorithm for ranking paths that may contain cycles
• Finding paths in graphs avoiding forbidden transitions
• On the difficulty of some shortest path problems
• Undirected single-source shortest paths with positive integer weights in linear time
• Oracles for Distances Avoiding a Failed Node or Link
• Efficient string matching
• Finding the k Shortest Paths
• Shortest Path Tree Computation in Dynamic Graphs
• A nearly optimal oracle for avoiding failed vertices and edges
• Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
• Many distances in planar graphs

This page was built for publication: Shortest paths avoiding forbidden subpaths