Items related to Extremal Paths in Graphs: Foundations, Search Strategies,...

Extremal Paths in Graphs: Foundations, Search Strategies, and Related Topics - Hardcover

 
9783527400546: Extremal Paths in Graphs: Foundations, Search Strategies, and Related Topics

This specific ISBN edition is currently not available.

Synopsis

The central problem in this book is the search for optimal paths in graphs. The simplest example is the search for the shortest connection from one place to another one in a city. The author investigates generalized versions of the Dijkstra algorithm and the Ford-Bellman algorithm; these generalized search strategies find paths with minimum or almost minimum costs even if the cost function is not computed by adding costs of the edges of a path. Many sorts of optimal path problems are described, for example the search for optimal paths in random graphs or NP-complete optimal path problems like the Traveling Salesman Problem. Also, the author studies structural properties of cost measures for paths in graphs; in particular, he investigates generalized versions of additivity, Bellman properties, and order preservation of cost functions. Moreover, the author quotes many combinatorial results on paths in graphs. A typical one is that the length of the longest simple cycle in an undirected graph is greater than the minimum valence of any vertex in this graph.

"synopsis" may belong to another edition of this title.

From the Publisher

This book examines the central problem of searching for optimal paths in graphs--the search for the shortest connection from one place to another one in a city, for example. It investigates generalized versions of the Dijkstra algorithm and the Ford-Bellman algorithm. These generalized search strategies find paths with minimum or almost minimum costs even if the cost function is not computed by adding costs of the edges of a path. The book describes many types of optimal path problems including the search for optimal paths in random graphs or NP-complete optimal path problems like the Traveling Salesman Problem. It also studies structural properties of cost measures for paths in graphs; in particular, generalized versions of additivity, Bellman properties, and order preservation of cost functions.

About the Author

Author's affiliation:
Ulrich Huckenbeck, Dr. habil., studied at the Technical University at Aachen, doctoral degree at the University of Würzburg, now working at the Ernst-Moritz-Arndt-University at Greifswald

"About this title" may belong to another edition of this title.

  • PublisherWiley-VCH
  • Publication date1997
  • ISBN 10 3527400540
  • ISBN 13 9783527400546
  • BindingHardcover
  • LanguageEnglish
  • Edition number1
  • Number of pages480

(No Available Copies)

Search Books:



Create a Want

Can't find the book you're looking for? We'll keep searching for you. If one of our booksellers adds it to AbeBooks, we'll let you know!

Create a Want

Other Popular Editions of the Same Title

9783055016585: Extremal Paths in Graphs: Foundations, Search Strategies, and Related Topics (Mathematical Topics, Vol 10)

Featured Edition

ISBN 10:  3055016580 ISBN 13:  9783055016585
Publisher: Vch Pub, 1997
Hardcover