ABSTRACT
The fusion between graph theory and combinatorial optimization has led to theoretically profound and practically useful algorithms, yet there is no book that currently covers both areas together. Handbook of Graph Theory, Combinatorial Optimization, and Algorithms is the first to present a unified, comprehensive treatment of both graph theory and c
TABLE OF CONTENTS
part |2 pages
SECTION I - Basic Concepts and Algorithms
part |2 pages
SECTION II - Flows in Networks
part |2 pages
SECTION III - Algebraic Graph Theory
part |2 pages
SECTION IV - Structural Graph Theory
part |2 pages
SECTION V - Planar Graphs
part |2 pages
SECTION VI - Interconnection Networks
part |2 pages
SECTION VII - Special Graphs
part |2 pages
SECTION VIII - Partitioning
part |2 pages
SECTION IX - Matroids
part |2 pages
SECTION X - Probabilistic Methods, Random Graph Models, and Randomized Algorithms
part |2 pages
SECTION XI - Coping with NP-Completeness