Algorithms - ESA 2003

DOI10.1007/b13632zbMath1266.68226OpenAlexW1827234103WikidataQ60299159 ScholiaQ60299159MaRDI QIDQ5897286

Peter Sanders, Jesper Larsson Träff, Irit Katriel

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

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)

Related Items (3)

The saga of minimum spanning trees ⋮ Pairing heaps: the forward variant. ⋮ On sorting, heaps, and minimum spanning trees

This page was built for publication: Algorithms - ESA 2003