Click on a thumbnail to go to Google Books.
Loading... Planar Graphs: Theory and Algorithmsby T. Nishizeki
None Loading...
Sign up for LibraryThing to find out whether you'll like this book. No current Talk conversations about this book. No reviews no reviews | add a review
Belongs to Publisher Series
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. No library descriptions found. |
Current DiscussionsNonePopular covers
Google Books — Loading... GenresMelvil Decimal System (DDC)511.5Natural sciences and mathematics Mathematics General Principles Graph TheoryLC ClassificationRatingAverage: No ratings.Is this you?Become a LibraryThing Author. |