Algorithms - ESA 2003
From MaRDI portal
Publication:5897266
DOI10.1007/b13632zbMath1266.68239OpenAlexW1827234103WikidataQ60299159 ScholiaQ60299159MaRDI QIDQ5897266
Publication date: 3 March 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b13632
Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (7)
I/O-efficient algorithms for graphs of bounded treewidth ⋮ Unnamed Item ⋮ On Trade-Offs in External-Memory Diameter-Approximation ⋮ Approximate shortest paths guided by a small index ⋮ Design and Engineering of External Memory Traversal Algorithms for General Graphs ⋮ Via Detours to I/O-Efficient Shortest Paths ⋮ The red-blue pebble game on trees and DAGs with large input
This page was built for publication: Algorithms - ESA 2003
