Loading…
Planar graphs : theory and algorithms /
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 c...
| Call Number: | Libro Electrónico |
|---|---|
| Main Author: | |
| Other Authors: | |
| Format: | Electronic eBook |
| Language: | Inglés |
| Published: |
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.
|
| Series: | North-Holland mathematics studies ;
140. Annals of discrete mathematics ; 32. |
| Subjects: | |
| Online Access: | Texto completo Texto completo Texto completo |
Table of Contents:
- Front Cover; Planar Graphs: Theory and Algorithms; Contents; Preface; Acknowledgments; Chapter 1. Graph Theoretic Foundations; Chapter 2. Algorithmic Foundations; Chapter 3. Planarity Testing and Embedding; Chapter 4. Drawing Planar Graphs; Chapter 5. Vertex-Coloring; Chapter 6. Edge-Coloring; Chapter 7. Independent Vertex Sets; Chapter 8. Listing Subgraphs; Chapter 9. Planar Separator Theorem; Chapter 10. Hamiltonian Cycles; Chapter 11. Flows in Planar Graphs; References; Index.