Planar Graphs: Volume 32
Theory and Algorithms
Published on 1. April 1988
Book
Hardback
231 pages
978-0-444-70212-8 (ISBN)
Description
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- or multicommodity flows. Suitable for a course on algorithms, graph theory, or planar graphs, the volume will also be useful for computer scientists and graph theorists at the research level. An extensive reference section is included.
Reviews / Votes
For many of the topics included, the present monograph is the first complete treatment in book form... will be useful not only for students but also for specialists in graph theory and computer science who are interested in the theory and algorithms for planar graphs.Zentralblatt fuer MathematikD. SeeseThe monograph can be recommended for graduate students and researchers in computer sceince and graph theory. It is also useful for a course on algorithmic graph theory or planar graphs.Biometrical JournalMore details
Series
Language
English
Place of publication
United States
Publishing group
Elsevier Science & Technology
Target group
College/higher education
Professional and scholarly
ISBN-13
978-0-444-70212-8 (9780444702128)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
E-Book
05/2014
North-Holland
€54.95
Available for download
Content
Graph Theoretic Foundations. Some Basic Definitions. Planar Graphs. Euler's Formula. Kuratowski's Theorem. Dual Graphs. Bounds for Planar Graphs. Algorithmic Foundations. What is an Algorithm? Machine Model and Complexity. NP-Complete. Data Structure and Graph Representation. Exploring a Graph.Planarity Testing and Embedding. Planarity Testing. Embedding Algorithm.Drawing Planar Graphs. Convex Drawing. Convex Testing. Example.Vertex-Coloring. Proof of Five-Coloring Theorem and 0(n2) Algorithm. Batch Processing Algorithm. Sequential Processing Algorithm. Edge-Coloring. Algorithm COLOR. Algorithm ALCOLOR. Edge-Coloring Multigraphs.Independent Vertex Sets. Approximation Algorithm. Baker's Algorithm.Listing Subgraphs. Arboricity and Efficient Edge-Searching. Listing Triangles. Listing Quadrangles. Listing Maximal Cliques.Planar Separator Theorem. Applications of the Planar Separator Theorem. Maximum Matching. Minimum Vertex Cover.Hamiltonian Cycles. Proof of Tutte's Theorem. Algorithm and 0(n2) Bound. Hamiltonian Walk. Flows in Planar Graphs. Definition of Multicommodity Flows. Planar Single-Commodity Flow. Multicommodity Flows for C1. Multicommodity Flows for Ca.Bibliography. Index.