Skip to main content

Planar Graphs

Theory and Algorithms

  • 1st Edition, Volume 32 - April 27, 2012
  • Authors: T. Nishizeki, N. Chiba
  • Language: English
  • Paperback ISBN:
    9 7 8 - 0 - 4 4 4 - 5 5 6 9 3 - 6
  • eBook ISBN:
    9 7 8 - 0 - 0 8 - 0 8 6 7 7 4 - 8

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… Read more

BACK-TO-SCHOOL

Fuel your confidence!

Up to 25% off learning resources

Elsevier academics book covers
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.

Related books