Cargando…
Planar graphs : theory and algorithms /
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...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Otros Autores: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Amsterdam ; New York : New York, N.Y., U.S.A. :
North-Holland ; Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co.,
1988.
|
| Colección: | North-Holland mathematics studies ;
140. Annals of discrete mathematics ; 32. |
| Temas: | |
| Acceso en línea: | Texto completo Texto completo Texto completo |
| Sumario: | 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. |
|---|---|
| Descripción Física: | 1 online resource (xii, 232 pages) : illustrations |
| Bibliografía: | Includes bibliographical references (pages 221-226) and index. |
| ISBN: | 9780444702128 0444702121 9780080867748 008086774X 1281798037 9781281798039 9786611798031 661179803X |