Reprint
Graph Algorithms
Edited by
July 2025
182 pages
- ISBN 978-3-7258-4509-5 (Hardback)
- ISBN 978-3-7258-4510-1 (PDF)
Print copies available soon
This is a Reprint of the Special Issue Graph Algorithms that was published in
Computer Science & Mathematics
Summary
This is a Reprint of one of the first Special Issues of Algorithms ever published. It focuses on the theoretical and practical performance of algorithms for solving computational problems involving graphs. Several highly cited articles are included, which investigate topics such as the maximum clique problem, the Dubins traveling salesman problem, and computing the eccentricity distribution of a graph.