Extremal Paths in Graphs - Ulrich Huckenbeck

Extremal Paths in Graphs

Foundation, Search Strategies, and Related Topics
480 Seiten
1997
Akademie Verlag Berlin (Hersteller)
978-3-05-501658-5 (ISBN)
111,46 inkl. MwSt
zur Neuauflage
  • Titel erscheint in neuer Auflage
  • Artikel merken
Zu diesem Artikel existiert eine Nachauflage
The main topic of this text is the search for optimal paths in graphs if the given cost function for paths satisfies very weak conditions. Moreover, the author studies structural properties of cost measures, and quotes many combinatorial results concerning paths in graphs.

Structural properties of cost functions for paths in graphs; generalized principles of order preservatioin, generalized Bellman principles; combinatorial results on paths in graphs; the search for optimal paths in graphs - generalized versions of the Dijkstra algorithm and of the Ford-Bellman algorithm; optimal path problems and their solutions in special graphs, for example in planar or in random graphs; hard path problems, for example the Travelling Salesman problem.

Zusatzinfo 28 Abb.
Verlagsort Weinheim
Sprache englisch
Maße 170 x 240 mm
Einbandart gebunden
Themenwelt Mathematik / Informatik Mathematik Analysis
Mathematik / Informatik Mathematik Graphentheorie
ISBN-10 3-05-501658-0 / 3055016580
ISBN-13 978-3-05-501658-5 / 9783055016585
Zustand Neuware
Haben Sie eine Frage zum Produkt?