scientific article; zbMATH DE number 1926659
From MaRDI portal
Publication:4707785
zbMath1014.68902MaRDI QIDQ4707785
Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis
Publication date: 11 June 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2409/24090043.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Computing methodologies and applications (68U99) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)
Related Items (11)
Search-space size in contraction hierarchies ⋮ Computing and listing \(st\)-paths in public transportation networks ⋮ Mvtree for hierarchical network representation based on geometric algebra subspace ⋮ A novel pseudo‐polynomial approach for shortest path problems ⋮ Connection Scan Algorithm ⋮ Computing and Listing st-Paths in Public Transportation Networks ⋮ Shortest-path queries in static networks ⋮ The Shortcut Problem – Complexity and Approximation ⋮ Engineering Route Planning Algorithms ⋮ Energy-optimal routes for battery electric vehicles ⋮ A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing
This page was built for publication:
