Planar Graphs: Theory and Algorithms - Brossura

Nishizeki, T.; Chiba, N.

 
9780486466712: Planar Graphs: Theory and Algorithms

Sinossi

This book features most of the important theorems and algorithms related to planar graphs. Eminently suitable as a text, it also is useful for researchers and includes an extensive reference section.
The authors, who have researched planar graphs for many years, have structured the topics in a manner relevant to graph theorists and computer scientists. The first two chapters are introductory and provide the foundations of the graph theoretic notions and algorithmic techniques used throughout the text. Succeeding chapters discuss planarity testing and embedding, drawing planar graphs, vertex- and edge-coloring, independent vertex sets, and subgraph listing. The text concludes with explorations of planar separator theorem, Hamiltonian cycles, and single-commodity or multi-commodity flows.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Product Description

This text features most of the important theorems and algorithms for planar graphs. Topics include planarity testing and embedding, drawing planar graphs, vertex- and edge-coloring, subgraph listing, planar separator theorem, Hamiltonian cycles, and single- or multi-commodity flows. Suitable as a textbook, it is also useful for researchers. 1988 edition.

Contenuti

Acknowledgments Preface 1. Graph Theoretic Foundations 2. Algorithmic Foundations 3. Planarity Testing and Embedding 4. Drawing Planar Graphs 5. Vertex-Coloring 6. Edge-Coloring 7. Independent Vertex Sets 8. Listing Subgraphs 9. Planar Separator Theorem 10. Hamiltonian Cycles 11. Flows in Planar Graphs References Index

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Altre edizioni note dello stesso titolo

9780444702128: Planar Graphs: Theory and Algorithms: Volume 32

Edizione in evidenza

ISBN 10:  0444702121 ISBN 13:  9780444702128
Casa editrice: Elsevier Science Ltd, 1988
Rilegato