Planar graphs [electronic resource] : theory and algorithms / T. Nishizeki and N. Chiba.
Material type:
TextSeries: North-Holland mathematics studies ; 140. | Annals of discrete mathematics ; 32.Publication details: Amsterdam ; New York : New York, N.Y., U.S.A. : North-Holland ; Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co., 1988. Description: 1 online resource (xii, 232 p.) : illISBN: 9780444702128; 0444702121Subject(s): Graph theory | Algorithms | Graphes, Th�eorie des | Algorithmes | Graphes, th�eorie des | Algorithmes | Algorithms | Graph theoryGenre/Form: Electronic books.Additional physical formats: Print version:: Planar graphs.DDC classification: 511/.5 LOC classification: QA166 | .N57 1988ebOnline resources: ScienceDirect | Volltext Summary: 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.
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.
Includes bibliographical references (p. 221-226) and index.
Description based on print version record.
There are no comments on this title.