Experimental and Efficient Algorithms
From MaRDI portal
Publication:5710017
DOI10.1007/b136461zbMath1121.68356OpenAlexW2485841483MaRDI QIDQ5710017
Dorothea Wagner, Rolf H. Möhring, Birk Schütz, Thomas Willhalm, Heiko Schilling
Publication date: 30 November 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b136461
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Finding the shortest paths by node combination ⋮ Time-dependent SHARC-routing ⋮ Subregion graph: a path planning acceleration structure for characters with various motion types in very large environments ⋮ Engineering Route Planning Algorithms ⋮ Traffic Networks and Flows over Time ⋮ A new bidirectional search algorithm with shortened postprocessing ⋮ A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
Uses Software
