Planar Graphs: Theory and Algorithms (Volume 32) (Annals of Discrete Mathematics, Volume 32) - Hardcover

Nishizeki, T.; Chiba, N.

 
9780444702128: Planar Graphs: Theory and Algorithms (Volume 32) (Annals of Discrete Mathematics, Volume 32)
Hardcover
ISBN 10: 0444702121 ISBN 13: 9780444702128
Publisher: North Holland, 1988

Synopsis

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.

"synopsis" may belong to another edition of this title.

Publisher
North Holland
Publication date
1988
Language
English
ISBN 10 
0444702121
ISBN 13 
9780444702128
Binding
Hardcover
Edition number
1
Number of pages
231

Other Popular Editions of the Same Title

9780486466712: Planar Graphs: Theory and Algorithms (Dover Books on Mathematics)

Featured Edition

ISBN 10:  048646671X ISBN 13:  9780486466712
Publisher: Dover Publications, 2008
Softcover