Für diesen Artikel ist leider kein Bild verfügbar.

Planar Graphs

Theory and Algorithms

T. Nishizeki, N. Chiba (Autoren)

Buch | Hardcover

246 Seiten

1988
Elsevier Science Ltd (Verlag)
978-0-444-70212-8 (ISBN)

Titel ist leider vergriffen;
keine Neuauflage

Artikel merken

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.

Graph Theoretic Foundations. Some Basic Definitions. Planar Graphs. Euler's Formula. Kuratowski's Theorem. Dual Graphs. Bounds for Planar Graphs. Algorithmic Foundations. What is an Algorithm? Machine Model and Complexity. NP-Complete. Data Structure and Graph Representation. Exploring a Graph. Planarity Testing and Embedding. Planarity Testing. Embedding Algorithm. Drawing Planar Graphs. Convex Drawing. Convex Testing. Example. Vertex-Coloring. Proof of Five-Coloring Theorem and 0(n 2 ) Algorithm. Batch Processing Algorithm. Sequential Processing Algorithm. Edge-Coloring. Algorithm COLOR. Algorithm ALCOLOR. Edge-Coloring Multigraphs. Independent Vertex Sets. Approximation Algorithm. Baker's Algorithm. Listing Subgraphs. Arboricity and Efficient Edge-Searching. Listing Triangles. Listing Quadrangles. Listing Maximal Cliques. Planar Separator Theorem. Applications of the Planar Separator Theorem. Maximum Matching. Minimum Vertex Cover. Hamiltonian Cycles. Proof of Tutte's Theorem. Algorithm and 0(n 2 ) Bound. Hamiltonian Walk. Flows in Planar Graphs. Definition of Multicommodity Flows. Planar Single-Commodity Flow. Multicommodity Flows for C 1 . Multicommodity Flows for C a . Bibliography. Index.

Reihe/Serie	Annals of Discrete Mathematics
Verlagsort	Oxford
Sprache	englisch
Maße	150 x 230 mm
Themenwelt	Mathematik / Informatik ► Informatik ► Theorie / Studium
Themenwelt	Mathematik / Informatik ► Mathematik ► Graphentheorie
ISBN-10	0-444-70212-1 / 0444702121
ISBN-13	978-0-444-70212-8 / 9780444702128
Zustand	Neuware