TY  - BOOK
AU  - Nishizeki,T.
AU  - Chiba,N.
TI  - Planar graphs: theory and algorithms 
T2  - North-Holland mathematics studies
SN  - 9780444702128
AV  - QA166 .N57 1988eb
U1  - 511/.5 22
PY  - 1988///
CY  - Amsterdam, New York, New York, N.Y., U.S.A.
PB  - North-Holland, Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co.
KW  - Graph theory
KW  - Algorithms
KW  - Graphes, Th�eorie des
KW  - Algorithmes
KW  - Graphes, th�eorie des
KW  - ram
KW  - fast
KW  - Electronic books
N1  - Includes bibliographical references (p. 221-226) and index
N2  - 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
UR  - http://www.sciencedirect.com/science/book/9780444702128
UR  - http://www.sciencedirect.com/science/publication?issn=03040208&volume=140
ER  -