๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

Planar Graphs: Theory and Algorithms

โœ Scribed by T. Nishizeki and N. Chiba (Eds.)


Publisher
Elsevier Science Ltd
Year
1988
Tongue
English
Leaves
247
Series
North-Holland Mathematics Studies 140 / Annals of Discrete Mathematics 32
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Synopsis


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 technical example without defining terminology: There is a figure 3.5 on page 41 which shows a planar graph and its abstraction into a "PQ-tree", containing P-nodes and Q-nodes. P-nodes are cut vertices in Bk and Q-nodes are 2-connected components of Gk. Bk is shown in the figure, as is the PQ-tree. Gk is not shown but aside from the virtual vertices it ought to correspond to Bk. The problem is that Bk clearly has two cut vertices whereas only one cut vertex is represented in the PQ-tree as a P-node. So there is obviously a missing piece of information: How does a Bk cut vertex get translated into a Q-node 2-connected component of Gk? It is at best incomplete and confusing, at worst just wrong. This is not the exception: it is the rule for how the book is written. Only by re-re-re-reading sections and filling in omitted details does one arrive at what the authors should have said. This is not clever. This is not "economical writing". This is wasting the reader's time making the subject unnecessarily difficult. If I were to peer-review chapters 1 through 3 of this book for a journal article I would recommend Do Not Publish Without Major Revisions. I appreciate that the authors started to write this book; they just need to finish it, please.

โœฆ Table of Contents


Content:
Advisory Editors
Page ii

Edited by
Page iii

Copyright page
Page iv

Dedication
Page v

Preface
Pages xi-xii
Takao Nishizeki, Norishige Chiba

Acknowledgments
Page xiii

Chapter 1 Graph Theoretic Foundations
Pages 1-21

Chapter 2 Algorithmic Foundations
Pages 23-32

Chapter 3 Planarity Testing and Embedding
Pages 33-63

Chapter 4 Drawing Planar Graphs
Pages 65-82

Chapter 5 Vertex-Coloring
Pages 83-97

Chapter 6 Edge-Coloring
Pages 99-119

Chapter 7 Independent Vertex Sets
Pages 121-135

Chapter 8 Listing Subgraphs
Pages 137-148

Chapter 9 Planar Separator Theorem
Pages 149-170

Chapter 10 Hamiltonian Cycles
Pages 171-184

Chapter 11 Flows in Planar Graphs
Pages 185-219

References
Pages 221-226

Index
Pages 227-232


๐Ÿ“œ SIMILAR VOLUMES


Planar Graphs: Theory and Algorithms
โœ T. Nishizeki and N. Chiba (Eds.) ๐Ÿ“‚ Library ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science Ltd ๐ŸŒ English

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

Algorithmic Graph Theory and Perfect Gra
โœ Martin Charles Golumbic (Eds.) ๐Ÿ“‚ Library ๐Ÿ“… 2004 ๐Ÿ› North Holland ๐ŸŒ English

Algorithmic Graph Theory and Perfect Graphs, first published in 1980, has become the classic introduction to the field. This new Annals edition continues to convey the message that intersection graph models are a necessary and important tool for solving real-world problems. It remains a stepping sto

Algorithmic Graph Theory and Perfect Gra
โœ Martin Charles Golumbic ๐Ÿ“‚ Library ๐Ÿ“… 1980 ๐Ÿ› Academic Press ๐ŸŒ English

Algorithmic Graph Theory and Perfect Graphs, first published in 1980, has become the classic introduction to the field. This new Annals edition continues to convey the message that intersection graph models are a necessary and important tool for solving real-world problems. It remains a stepping sto

Algorithmic Graph Theory and Perfect Gra
โœ Martin Charles Golumbic (Eds.) ๐Ÿ“‚ Library ๐Ÿ“… 2004 ๐Ÿ› Elsevier, Academic Press ๐ŸŒ English

Algorithmic Graph Theory and Perfect Graphs, first published in 1980, has become the classic introduction to the field. This new Annals edition continues to convey the message that intersection graph models are a necessary and important tool for solving real-world problems. It remains a stepping sto

Algorithmic Graph Theory and Perfect Gra
โœ Martin Charles Golumbic (Eds.) ๐Ÿ“‚ Library ๐Ÿ“… 2004 ๐Ÿ› Butterworth heineman ๐ŸŒ English

Algorithmic Graph Theory and Perfect Graphs, first published in 1980, has become the classic introduction to the field. This new Annals edition continues to convey the message that intersection graph models are a necessary and important tool for solving real-world problems. It remains a stepping sto