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

Huckenbeck, Ulrich

ISBN 10: 3055016580 / ISBN 13: 9783055016585

Published by Vch Pub, 1997

About this Item

A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.

Seller Inventory # OTV.3055016580.G

Bibliographic Details

• Title: Extremal Paths in Graphs: Foundations, Search Strategies, and Related Topics (Mathematical Topics, Vol 10)
• Publisher: Vch Pub
• Publication Date: 1997
• Language: English
• ISBN 10: 3055016580
• ISBN 13: 9783055016585
• Binding: Hardcover
• Condition: good

About this title

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