This book is not a standard textbook on graph theory. The authors have been working for more than ten years on the algorithmic aspects of planar graph theory, and this book gathers most of their results. Some of the topics discussed in the book are planarity testing, drawing convex graphs, vertex- and edge-coloring and subgraph listing.
However, the book is not a mere list of algorithms. There are some theoretical sections with proofs of theorems. The algorithms are written in Pidgin PASCAL and can be then easily implemented and tested. This book will be of interest especially for computer scientists and graph theorists.
Fabio Mainardi earned a PhD in Mathematics at the University of Paris 13. His research interests are mainly Iwasawa theory, p-adic L-functions and the arithmetic of automorphic forms. At present, he works in a "classe préparatoire" in Geneva. He may be reached at firstname.lastname@example.org.
|1. Graph Theoretic Foundations|
|2. Algorithmic Foundations|
|3. Planarity Testing and Embedding|
|4. Drawing Planar Graphs|
|7. Independent Vertex Sets|
|8. Listing Subgraphs|
|9. Planar Separator Theorem|
|10. Hamiltonian Cycles|
|11. Flows in Planar Graphs|