Graphs and Networks

Transfinite and nonstandard

Armen H. Zemanian - Collection Algorithms and Computation in Mathematics

202 pages, parution le 27/10/2004

Ajouter à une liste

Indisponible

Résumé

From the reviews of the first edition: ".... The book is a first class textbook and seems to be indispensable for everybody who has to teach combinatorial optimization. It is very helpful for students, teachers, and researchers in this area. The author finds a striking synthesis of nice and interesting mathematical results and practical applications. ... the author pays much attention to the inclusion of well-chosen exercises. The reader does not remain helpless; solutions or at least hints are given in the appendix. Except for some small basic mathematical and algorithmic knowledge the book is self-contained. ..." Mathematical Reviews 2002 This thoroughly revised new edition offers a new chapter on the network simplex algorithm and a section on the five color theorem. Moreover, numerous smaller changes and corrections have been made and several recent developments have been discussed and referenced.

Sommaire

Preface
Basic Graph Theory
Algorithms and Complexity
Shortest Paths
Spanning Trees
The Greedy Algorithm
Flows
Combinatorial Applications
Connectivity and Depth First Search
Colorings
Circulations
The Network Simplex Algorithm
Matchings
Weighted Matchings
A Hard Problem: The TSP

Voir tout

Replier

Caractéristiques techniques

	PAPIER
Éditeur(s)	Birkhäuser
Auteur(s)	Armen H. Zemanian
Collection	Algorithms and Computation in Mathematics
Parution	27/10/2004
Nb. de pages	202
Format	15,5 x 23,5
Couverture	Broché
Poids	373g
Intérieur	Noir et Blanc
EAN13	9780817642921
ISBN13	978-0-8176-4292-1