Reset Filters
CLC: D - 政治、法律

Cover is for reference only

Planar graphs : theory and algorithms /

Collected in this volume are most of the important theorems and algorithms currently known for planar graphs, together with constructive proofs for the theorems. Many of the algorithms are written in Pidgin PASCAL, and are the best-known ones; the complexities are linear or 0(nlogn). The first two c...

Full description

Saved in:
Bibliographic Details
Main Authors: Nishizeki, T. Takao, 1947
Corporate Authors: Elsevier Science & Technology
Group Author: Chiba, N. Norishige
Published: North-Holland ; Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co.,
Publisher Address: Amsterdam ; New York : New York, N.Y., U.S.A. :
Publication Dates: 1988.
Literature type: eBook
Language: English
Series: North-Holland mathematics studies ; 140
Annals of discrete mathematics ; 32
Subjects:
Graph theory
Algorithms
Graphes, The orie des
Algorithmes
MATHEMATICS > Graphic Methods
Electronic books
Online Access: http://www.sciencedirect.com/science/bookseries/03040208/140
Summary: Collected in this volume are most of the important theorems and algorithms currently known for planar graphs, together with constructive proofs for the theorems. Many of the algorithms are written in Pidgin PASCAL, and are the best-known ones; the complexities are linear or 0(nlogn). The first two chapters provide the foundations of graph theoretic notions and algorithmic techniques. The remaining chapters discuss the topics of planarity testing, embedding, drawing, vertex- or edge-coloring, maximum independence set, subgraph listing, planar separator theorem, Hamiltonian cycles, and single-
Carrier Form: 1 online resource (xii, 232 pages) : illustrations.
Bibliography: Includes bibliographical references (pages 221-226) and index.
ISBN: 9780444702128
0444702121
9780080867748
008086774X
Index Number: QA166
CLC: O157.5
Contents: Front Cover; Planar Graphs: Theory and Algorithms; Contents; Preface; Acknowledgments; Chapter 1. Graph Theoretic Foundations; Chapter 2. Algorithmic Foundations; Chapter 3. Planarity Testing and Embedding; Chapter 4. Drawing Planar Graphs; Chapter 5. Vertex-Coloring; Chapter 6. Edge-Coloring; Chapter 7. Independent Vertex Sets; Chapter 8. Listing Subgraphs; Chapter 9. Planar Separator Theorem; Chapter 10. Hamiltonian Cycles; Chapter 11. Flows in Planar Graphs; References; Index.

Related Book Recommendations