Planar Graphs: Theory and Algorithms - Couverture souple

Nishizeki, T; Chiba, N

Couverture souple

ISBN 10 : 048646671X ISBN 13 : 9780486466712

Editeur : Dover Publications Inc., 2008

Synopsis

This text features most of the important theorems and algorithms for planar graphs. Suitable as a textbook, it is also useful for researchers and includes an extensive reference section. 1988 edition.

A propos du livre

Présentation de l'éditeur

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.

Détails de l'édition

• Éditeur: Dover Publications Inc.
• Date d'édition: 2008
• Langue: anglais
• ISBN 10: 048646671X
• ISBN 13: 9780486466712
• Reliure: Broché
• Nombre de pages: 232
• Coordonnées du fabricant: non disponible
• Personne responsable: Soc. Agr. La Raia Ss; http://www.la-raia.it; ; Strada Monterotondo, 79; Novi Ligure; 15067; Italie