Planar graphs: theory and algorithms
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
North-Holland
1988
|
| Schriftenreihe: | North-Holland mathematics studies
140 Annals of discrete mathematics 32 |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Beschreibung: | 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 Includes bibliographical references (p. 221-226) and index |
| Beschreibung: | 1 Online-Ressource (xii, 232 p.) |
| ISBN: | 9780444702128 0444702121 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV042317607 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150129s1988 |||| o||u| ||||||eng d | ||
| 020 | |a 9780444702128 |9 978-0-444-70212-8 | ||
| 020 | |a 0444702121 |9 0-444-70212-1 | ||
| 035 | |a (ZDB-33-EBS)ocn316566717 | ||
| 035 | |a (OCoLC)316566717 | ||
| 035 | |a (DE-599)BVBBV042317607 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-1046 | ||
| 082 | 0 | |a 511/.5 |2 22 | |
| 100 | 1 | |a Nishizeki, T., (Takao) |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Planar graphs |b theory and algorithms |c T. Nishizeki and N. Chiba |
| 264 | 1 | |a Amsterdam |b North-Holland |c 1988 | |
| 300 | |a 1 Online-Ressource (xii, 232 p.) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a North-Holland mathematics studies |v 140 | |
| 490 | 0 | |a Annals of discrete mathematics |v 32 | |
| 500 | |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 | ||
| 500 | |a Includes bibliographical references (p. 221-226) and index | ||
| 650 | 4 | |a Graphes, Théorie des | |
| 650 | 4 | |a Algorithmes | |
| 650 | 7 | |a Graphes, théorie des |2 ram | |
| 650 | 7 | |a Algorithmes |2 ram | |
| 650 | 7 | |a Algorithms |2 fast | |
| 650 | 7 | |a Graph theory |2 fast | |
| 650 | 4 | |a Graph theory | |
| 650 | 4 | |a Algorithms | |
| 650 | 0 | 7 | |a Planarer Graph |0 (DE-588)4174783-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Planarer Graph |0 (DE-588)4174783-5 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 700 | 1 | |a Chiba, N. |e Sonstige |4 oth | |
| 856 | 4 | 0 | |u http://www.sciencedirect.com/science/book/9780444702128 |x Verlag |3 Volltext |
| 912 | |a ZDB-33-ESD |a ZDB-33-EBS | ||
| 940 | 1 | |q FAW_PDA_ESD | |
| 940 | 1 | |q FLA_PDA_ESD | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027754598 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804152914221989888 |
|---|---|
| any_adam_object | |
| author | Nishizeki, T., (Takao) |
| author_facet | Nishizeki, T., (Takao) |
| author_role | aut |
| author_sort | Nishizeki, T., (Takao) |
| author_variant | t t n tt ttn |
| building | Verbundindex |
| bvnumber | BV042317607 |
| collection | ZDB-33-ESD ZDB-33-EBS |
| ctrlnum | (ZDB-33-EBS)ocn316566717 (OCoLC)316566717 (DE-599)BVBBV042317607 |
| dewey-full | 511/.5 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511/.5 |
| dewey-search | 511/.5 |
| dewey-sort | 3511 15 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02617nmm a2200541zcb4500</leader><controlfield tag="001">BV042317607</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150129s1988 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780444702128</subfield><subfield code="9">978-0-444-70212-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0444702121</subfield><subfield code="9">0-444-70212-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-33-EBS)ocn316566717</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)316566717</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042317607</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-1046</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.5</subfield><subfield code="2">22</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Nishizeki, T., (Takao)</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Planar graphs</subfield><subfield code="b">theory and algorithms</subfield><subfield code="c">T. Nishizeki and N. Chiba</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="b">North-Holland</subfield><subfield code="c">1988</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xii, 232 p.)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">North-Holland mathematics studies</subfield><subfield code="v">140</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Annals of discrete mathematics</subfield><subfield code="v">32</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="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</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (p. 221-226) and index</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graphes, Théorie des</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithmes</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Graphes, théorie des</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithmes</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithms</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Graph theory</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Planarer Graph</subfield><subfield code="0">(DE-588)4174783-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Planarer Graph</subfield><subfield code="0">(DE-588)4174783-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Chiba, N.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://www.sciencedirect.com/science/book/9780444702128</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-33-ESD</subfield><subfield code="a">ZDB-33-EBS</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">FAW_PDA_ESD</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">FLA_PDA_ESD</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027754598</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| id | DE-604.BV042317607 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:18:17Z |
| institution | BVB |
| isbn | 9780444702128 0444702121 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027754598 |
| oclc_num | 316566717 |
| open_access_boolean | |
| owner | DE-1046 |
| owner_facet | DE-1046 |
| physical | 1 Online-Ressource (xii, 232 p.) |
| psigel | ZDB-33-ESD ZDB-33-EBS FAW_PDA_ESD FLA_PDA_ESD |
| publishDate | 1988 |
| publishDateSearch | 1988 |
| publishDateSort | 1988 |
| publisher | North-Holland |
| record_format | marc |
| series2 | North-Holland mathematics studies Annals of discrete mathematics |
| spelling | Nishizeki, T., (Takao) Verfasser aut Planar graphs theory and algorithms T. Nishizeki and N. Chiba Amsterdam North-Holland 1988 1 Online-Ressource (xii, 232 p.) txt rdacontent c rdamedia cr rdacarrier North-Holland mathematics studies 140 Annals of discrete mathematics 32 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 Includes bibliographical references (p. 221-226) and index Graphes, Théorie des Algorithmes Graphes, théorie des ram Algorithmes ram Algorithms fast Graph theory fast Graph theory Algorithms Planarer Graph (DE-588)4174783-5 gnd rswk-swf Planarer Graph (DE-588)4174783-5 s 1\p DE-604 Chiba, N. Sonstige oth http://www.sciencedirect.com/science/book/9780444702128 Verlag Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Nishizeki, T., (Takao) Planar graphs theory and algorithms Graphes, Théorie des Algorithmes Graphes, théorie des ram Algorithmes ram Algorithms fast Graph theory fast Graph theory Algorithms Planarer Graph (DE-588)4174783-5 gnd |
| subject_GND | (DE-588)4174783-5 |
| title | Planar graphs theory and algorithms |
| title_auth | Planar graphs theory and algorithms |
| title_exact_search | Planar graphs theory and algorithms |
| title_full | Planar graphs theory and algorithms T. Nishizeki and N. Chiba |
| title_fullStr | Planar graphs theory and algorithms T. Nishizeki and N. Chiba |
| title_full_unstemmed | Planar graphs theory and algorithms T. Nishizeki and N. Chiba |
| title_short | Planar graphs |
| title_sort | planar graphs theory and algorithms |
| title_sub | theory and algorithms |
| topic | Graphes, Théorie des Algorithmes Graphes, théorie des ram Algorithmes ram Algorithms fast Graph theory fast Graph theory Algorithms Planarer Graph (DE-588)4174783-5 gnd |
| topic_facet | Graphes, Théorie des Algorithmes Graphes, théorie des Algorithms Graph theory Planarer Graph |
| url | http://www.sciencedirect.com/science/book/9780444702128 |
| work_keys_str_mv | AT nishizekittakao planargraphstheoryandalgorithms AT chiban planargraphstheoryandalgorithms |