Planar Graph Drawing
โ Scribed by Takao Nishizeki, Dr Md Saidur Rahman
- Publisher
- World Scientific
- Year
- 2004
- Tongue
- English
- Leaves
- 310
- Series
- Lecture notes series on computing 12
- Category
- Library
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
The author obtains a complete description of the planar cubic Cayley graphs, providing an explicit presentation and embedding for each of them. This turns out to be a rich class, comprising several infinite families. He obtains counterexamples to conjectures of Mohar, Bonnington and Watkins. The aut
I strongly suggest avoiding this book until the authors produce a more readable/useable next edition. Or else just go find an alternative book. The subject matter is quite interesting and useful but the book makes it extremely difficult to learn. For the sake of definiteness I will provide a techni