Shortest paths avoiding forbidden subpaths

DOI10.1002/NET.21490MaRDI QIDQ5326797zbMATH OpenOpenAlexFDO

Authors Mustaq Ahmed, Anna Lubiw

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

Dijkstraexception avoiding pathgraph algorithmoptical networkroad network

Mathematics Subject Classification ID

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

Recommendations

• Shortest Paths Avoiding Forbidden Subpaths
• A note on shortest path problems with forbidden paths
• The shortest path problem with forbidden paths
• Shortest path problem with forbidden paths: the elementary version
• Shortest path-planning in road nets with forbidden routes

Cites work

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

Cited in

(6)

• The shortest path problem with forbidden paths
• Finding paths in grids with forbidden transitions
• A note on shortest path problems with forbidden paths
• Simple Paths and Cycles Avoiding Forbidden Paths
• Shortest Paths Avoiding Forbidden Subpaths
• Shortest paths with exclusive-disjunction arc pairs conflicts

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326797)