2742 Lorena Begnozzi: Grafi e algoritmi sui grafi. Tesi, Ferrara 1991. K. Booth/G. Lueker: Testing for consecutive ones property, interval graphs and planarity using PQ-tree algorithms. J. Comp. Syst. Sci. 13 (1976), 335-379. 20437 Ralf Borndörfer/Martin Grötschel/Andreas Löbl: Der schnellste Weg zum Ziel. In 18053 Aigner/ (2002), 45-76. Andreas Brandsta''dt: Graphen und Algorithmen. Teubner 1994, 260p. 3-519-02131-5. DM 43. 27668 Douglas Campbell/David Radford: Tree isomorphism algorithms - speed versus clarity. Math. Mag. 64 (1991), 252-261. N. Christofidis: Graph theory - an algorithmic approach. Academic Press 1975. 7208 T. Cormen/C. Leiserson/R. Rivest: Introduzione agli algoritmi. 3 volumi. Jackson, tog. 1050p. 88-256-0449-1, -0652-4, 0679-6. Tog. Lire 126.000. 14354 Martin Erwig: The graph Voronoi diagram with applications. Internet ca. 1996, 14p. S. Even: Algorithm for determining whether the connectivity of a graph is at least k. SIAM J. Comp. 6 (1977), 393-396. 27389 Shimon Even: Graph algorithms. Cambridge UP 2012, 190p. Eur 30. S. Even/A. Itai/A. Shamir: On the complexity of timetable and multicommodity flow problems. SIAM J. Comp. 5 (1976), 691-703. S. Even/R. Tarjan: Network flow and testing graph connectivity. SIAM J. Comp. 4 (1975), 507-512. A. Gibbons: Algorithmic graph theory. Cambridge UP 1985. M. Golumbic: Algorithmic graph theory and perfect graphs. Academic Press 1980. 21257 Horst Hamacher/Kathrin Klamroth: Lineare Optimierung und Netzwerkoptimierung. Vieweg 2006, 240p. Eur 32. 21571 Pierre Hansen/Hadrien Melot: Computers and discovery in algebraic graph theory. Internet 2001, 23p. 11206 M. Haouari/P. Dejax: Plus court chemin avec dependance horaire - resolution et application aux problemes de tournees. RAIRO Rech. Op. 31 (1997), 117-131. 9870 Dieter Jungnickel: Graphen, Netzwerke und Algorithmen. Bibl. Inst. 1994, 700p. 3-411-14263-4. DM 98. Brian Kernighan/S. Lin: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49 (1970), 291-307. 27383 Sven Oliver Krumke/Hartmut Noltemeier: Graphentheoretische Konzepte und Algorithmen. Springer 2012, 430p. Eur 17 (Ebuch). K. Mehlhorn: Data structures and algorithms II. Graph algorithms and NP-completeness. Springer 1984. 27384 Volker Turau/Christoph Weyer: Algorithmische Graphentheorie. De Gruyter 2015, 400p. Eur 44. Gabriel Valiente: Algorithms for trees and graphs. Springer 2002, 450p. $50. 27386 Hansjoachim Walther/Günter Nägler: Graphen - Algorithmen - Programme. Springer 1987, 190p. Eur 54.