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.
- No. of pages:
- © North Holland 1988
- 1st April 1988
- North Holland
- eBook ISBN:
- Hardcover ISBN:
@qu: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. @source:Zentralblatt für Mathematik @from:D. Seese @qu:The 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. @source:Biometrical Journal