Planar Graphs
：Theory and Algorithms
( Volume 32 )
Publication subTitle ：Theory and Algorithms
Publication series ：Volume 32
Publisher： Elsevier Science
Publication year： 1988
E-ISBN: 9780080867748
P-ISBN(Paperback): 9780444702128
P-ISBN(Hardback): 9780444702128
Subject： O157.5 Graph
Language： ENG
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
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.
Chapter