Automata, Languages and Programming
From MaRDI portal
Publication:5716779
DOI10.1007/11523468zbMath1082.68594OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716779
Publication date: 10 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11523468
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (9)
Efficiently Listing Bounded Length st-Paths ⋮ Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs ⋮ An efficient time and space \(K\) point-to-point shortest simple paths algorithm ⋮ Improved algorithms for the \(k\) simple shortest paths and the replacement paths problems ⋮ An Experimental Study on Approximating k Shortest Simple Paths ⋮ Incremental distance products via faulty shortest paths ⋮ Ranking One Million Simple Paths in Road Networks ⋮ Unnamed Item ⋮ Unnamed Item
This page was built for publication: Automata, Languages and Programming
