Shortest paths in almost acyclic graphs

DOI10.1016/S0167-6377(00)00054-7zbMath1096.90544OpenAlexW2012693837MaRDI QIDQ5929143

Donald K. Wagner

Publication date: 2000

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(00)00054-7

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Paths and cycles (05C38)

Cites Work

• A greedy randomized adaptive search procedure for the feedback vertex set problem
• On a routing problem
• Unnamed Item
• Unnamed Item

This page was built for publication: Shortest paths in almost acyclic graphs