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

Huckenbeck, Ulrich

Hardcover

ISBN 10: 3055016580 ISBN 13: 9783055016585

Publisher: Vch Pub, 1997

Synopsis

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 this title

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

Language Notes

Text: English (translation)
Original Language: German

Edition details

• Publisher: Vch Pub
• Publication date: 1997
• ISBN 10: 3055016580
• ISBN 13: 9783055016585
• Binding: Hardcover
• Language: English
• Edition number: 1
• Number of pages: 480