Extremal Paths in Graphs: Foundations, Search Strategies and Related Topics - Mathematical Topics S. Vol 10 (Hardback)
  • Extremal Paths in Graphs: Foundations, Search Strategies and Related Topics - Mathematical Topics S. Vol 10 (Hardback)
zoom

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

(author)
£60.00
Hardback 450 Pages / Published: 01/12/1998
  • Not available

This product is currently unavailable.

  • This item has been added to your basket
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.

Publisher: Wiley-VCH Verlag GmbH
ISBN: 9783527400546
Number of pages: 450
Weight: 1102 g
Dimensions: 230 x 182 x 30 mm

You may also be interested in...

A Combinatorial Introduction to Topology
Added to basket
Introduction to Graph Theory
Added to basket
Proofs from THE BOOK
Added to basket
Problems in Probability
Added to basket
Proofs and Fundamentals
Added to basket
Discrete Mathematics
Added to basket
Combinatorial Optimization
Added to basket

Reviews

Please sign in to write a review

Your review has been submitted successfully.