Published in

Springer, Lecture Notes in Computer Science, p. 360-371, 2008

DOI: 10.1007/978-3-540-92248-3_32

Links

Tools

Export citation

Search in Google Scholar

A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes

Book chapter published in 2008 by Siamak Tazari, Matthias Müller-Hannemann ORCID
Distributing this paper is prohibited by the publisher
Distributing this paper is prohibited by the publisher

Full text: Unavailable

Red circle
Preprint: archiving forbidden
Orange circle
Postprint: archiving restricted
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO