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 |
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | SCIDIR_ocn316566717 | ||
| 003 | OCoLC | ||
| 005 | 20231117015239.0 | ||
| 006 | m o d | ||
| 007 | cr cn||||||||| | ||
| 008 | 090320s1988 ne a ob 001 0 eng d | ||
| 040 | |a OPELS |b eng |e pn |c OPELS |d OPELS |d OCLCQ |d OCLCF |d OCLCO |d DEBBG |d N$T |d IDEBK |d E7B |d MERUC |d YDXCP |d OCLCQ |d DEBSZ |d LEAUB |d INARC |d VLY |d S2H |d OCLCO |d OCLCQ |d OCLCA |d OCLCQ |d OCLCO | ||
| 019 | |a 312403253 |a 646775919 |a 1150937360 |a 1162454373 | ||
| 020 | |a 9780444702128 | ||
| 020 | |a 0444702121 | ||
| 020 | |a 9780080867748 |q (electronic bk.) | ||
| 020 | |a 008086774X |q (electronic bk.) | ||
| 020 | |a 1281798037 | ||
| 020 | |a 9781281798039 | ||
| 020 | |a 9786611798031 | ||
| 020 | |a 661179803X | ||
| 035 | |a (OCoLC)316566717 |z (OCoLC)312403253 |z (OCoLC)646775919 |z (OCoLC)1150937360 |z (OCoLC)1162454373 | ||
| 050 | 4 | |a QA166 |b .N57 1988eb | |
| 072 | 7 | |a MAT |x 013000 |2 bisacsh | |
| 082 | 0 | 4 | |a 511/.5 |2 22 |
| 100 | 1 | |a Nishizeki, T. |q (Takao), |d 1947-2022. | |
| 245 | 1 | 0 | |a Planar graphs : |b theory and algorithms / |c T. Nishizeki and N. Chiba. |
| 260 | |a Amsterdam ; |a New York : |b North-Holland ; |a New York, N.Y., U.S.A. : |b Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co., |c 1988. | ||
| 300 | |a 1 online resource (xii, 232 pages) : |b illustrations | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a North-Holland mathematics studies ; |v 140 | |
| 490 | 1 | |a Annals of discrete mathematics ; |v 32 | |
| 520 | |a 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. | ||
| 504 | |a Includes bibliographical references (pages 221-226) and index. | ||
| 588 | 0 | |a Print version record. | |
| 505 | 0 | |a Front Cover; Planar Graphs: Theory and Algorithms; Contents; Preface; Acknowledgments; Chapter 1. Graph Theoretic Foundations; Chapter 2. Algorithmic Foundations; Chapter 3. Planarity Testing and Embedding; Chapter 4. Drawing Planar Graphs; Chapter 5. Vertex-Coloring; Chapter 6. Edge-Coloring; Chapter 7. Independent Vertex Sets; Chapter 8. Listing Subgraphs; Chapter 9. Planar Separator Theorem; Chapter 10. Hamiltonian Cycles; Chapter 11. Flows in Planar Graphs; References; Index. | |
| 546 | |a English. | ||
| 650 | 0 | |a Graph theory. | |
| 650 | 0 | |a Algorithms. | |
| 650 | 2 | |a Algorithms |0 (DNLM)D000465 | |
| 650 | 6 | |a Th�eorie des graphes. |0 (CaQQLa)201-0024153 | |
| 650 | 6 | |a Algorithmes. |0 (CaQQLa)201-0001230 | |
| 650 | 7 | |a algorithms. |2 aat |0 (CStmoGRI)aat300065585 | |
| 650 | 7 | |a MATHEMATICS |x Graphic Methods. |2 bisacsh | |
| 650 | 7 | |a Algorithms |2 fast |0 (OCoLC)fst00805020 | |
| 650 | 7 | |a Graph theory |2 fast |0 (OCoLC)fst00946584 | |
| 650 | 7 | |a Graphes, th�eorie des. |2 ram | |
| 650 | 7 | |a Algorithmes. |2 ram | |
| 700 | 1 | |a Chiba, N. |q (Norishige) | |
| 776 | 0 | 8 | |i Print version: |a Nishizeki, T. (Takao), 1947- |t Planar graphs. |d Amsterdam ; New York : North-Holland ; New York, N.Y., U.S.A. : Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co., 1988 |z 0444702121 |z 9780444702128 |w (DLC) 88004980 |w (OCoLC)17649731 |
| 830 | 0 | |a North-Holland mathematics studies ; |v 140. | |
| 830 | 0 | |a Annals of discrete mathematics ; |v 32. | |
| 856 | 4 | 0 | |u https://sciencedirect.uam.elogim.com/science/book/9780444702128 |z Texto completo |
| 856 | 4 | 0 | |u https://sciencedirect.uam.elogim.com/science/publication?issn=03040208&volume=140 |z Texto completo |
| 856 | 4 | 0 | |u https://sciencedirect.uam.elogim.com/science/bookseries/03040208/140 |z Texto completo |