
- 231 pages
- English
- PDF
- Available on iOS & Android
About this book
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.
Frequently asked questions
- Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
- Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Information
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