Algorithmic graph theory and perfect graphs:
Saved in:
| Main Author: | |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Amsterdam
Elsevier
2004
|
| Series: | Annals of discrete mathematics
57 |
| Subjects: | |
| Online Access: | Volltext |
| Item Description: | Algorithmic Graph Theory and Perfect Graphs, first published in 1980, has become the classic introduction to the field. This new Annals edition continues to convey the message that intersection graph models are a necessary and important tool for solving real-world problems. It remains a stepping stone from which the reader may embark on one of many fascinating research trails. The past twenty years have been an amazingly fruitful period of research in algorithmic graph theory and structured families of graphs. Especially important have been the theory and applications of new intersection graph models such as generalizations of permutation graphs and interval graphs. These have lead to new families of perfect graphs and many algorithmic results. These are surveyed in the new Epilogue chapter in this second edition. New edition of the "Classic" book on the topic. Wonderful introduction to a rich research area Leading author in the field of algorithmic graph theory. Beautifully written for the new mathematician or computer scientist. Comprehensive treatment Includes bibliographical references and index |
| Physical Description: | 1 Online-Ressource (xxvi, 314 pages) |
| ISBN: | 9780444515308 0444515305 0080526969 9780080526966 |
Staff View
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV042317341 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150129s2004 |||| o||u| ||||||eng d | ||
| 020 | |a 9780444515308 |9 978-0-444-51530-8 | ||
| 020 | |a 0444515305 |9 0-444-51530-5 | ||
| 020 | |a 0080526969 |c electronic bk. |9 0-08-052696-9 | ||
| 020 | |a 9780080526966 |c electronic bk. |9 978-0-08-052696-6 | ||
| 035 | |a (ZDB-33-EBS)ocn162579997 | ||
| 035 | |a (OCoLC)162579997 | ||
| 035 | |a (DE-599)BVBBV042317341 | ||
| 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 Golumbic, Martin Charles |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Algorithmic graph theory and perfect graphs |c Martin Charles Golumbic |
| 264 | 1 | |a Amsterdam |b Elsevier |c 2004 | |
| 300 | |a 1 Online-Ressource (xxvi, 314 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Annals of discrete mathematics |v 57 | |
| 500 | |a Algorithmic Graph Theory and Perfect Graphs, first published in 1980, has become the classic introduction to the field. This new Annals edition continues to convey the message that intersection graph models are a necessary and important tool for solving real-world problems. It remains a stepping stone from which the reader may embark on one of many fascinating research trails. The past twenty years have been an amazingly fruitful period of research in algorithmic graph theory and structured families of graphs. Especially important have been the theory and applications of new intersection graph models such as generalizations of permutation graphs and interval graphs. These have lead to new families of perfect graphs and many algorithmic results. These are surveyed in the new Epilogue chapter in this second edition. New edition of the "Classic" book on the topic. Wonderful introduction to a rich research area Leading author in the field of algorithmic graph theory. Beautifully written for the new mathematician or computer scientist. Comprehensive treatment | ||
| 500 | |a Includes bibliographical references and index | ||
| 650 | 4 | |a Graphes parfaits | |
| 650 | 7 | |a Perfect graphs |2 fast | |
| 650 | 7 | |a Grafentheorie |2 gtt | |
| 650 | 7 | |a Teoria dos grafos |2 larpcal | |
| 650 | 7 | |a Computabilidade e complexidade |2 larpcal | |
| 650 | 7 | |a Programação matemática |2 larpcal | |
| 650 | 7 | |a Programação inteira e fluxos em rede |2 larpcal | |
| 650 | 4 | |a Perfect graphs | |
| 650 | 0 | 7 | |a Graph |0 (DE-588)4021842-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
| 689 | 0 | 1 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 689 | 1 | 0 | |a Graph |0 (DE-588)4021842-9 |D s |
| 689 | 1 | |8 2\p |5 DE-604 | |
| 856 | 4 | 0 | |u http://www.sciencedirect.com/science/book/9780444515308 |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-027754331 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Record in the Search Index
| _version_ | 1804152913665196032 |
|---|---|
| any_adam_object | |
| author | Golumbic, Martin Charles |
| author_facet | Golumbic, Martin Charles |
| author_role | aut |
| author_sort | Golumbic, Martin Charles |
| author_variant | m c g mc mcg |
| building | Verbundindex |
| bvnumber | BV042317341 |
| collection | ZDB-33-ESD ZDB-33-EBS |
| ctrlnum | (ZDB-33-EBS)ocn162579997 (OCoLC)162579997 (DE-599)BVBBV042317341 |
| 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>03302nmm a2200613zcb4500</leader><controlfield tag="001">BV042317341</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150129s2004 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780444515308</subfield><subfield code="9">978-0-444-51530-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0444515305</subfield><subfield code="9">0-444-51530-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0080526969</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">0-08-052696-9</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780080526966</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">978-0-08-052696-6</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-33-EBS)ocn162579997</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)162579997</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042317341</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">Golumbic, Martin Charles</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithmic graph theory and perfect graphs</subfield><subfield code="c">Martin Charles Golumbic</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="b">Elsevier</subfield><subfield code="c">2004</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xxvi, 314 pages)</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">Annals of discrete mathematics</subfield><subfield code="v">57</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Algorithmic Graph Theory and Perfect Graphs, first published in 1980, has become the classic introduction to the field. This new Annals edition continues to convey the message that intersection graph models are a necessary and important tool for solving real-world problems. It remains a stepping stone from which the reader may embark on one of many fascinating research trails. The past twenty years have been an amazingly fruitful period of research in algorithmic graph theory and structured families of graphs. Especially important have been the theory and applications of new intersection graph models such as generalizations of permutation graphs and interval graphs. These have lead to new families of perfect graphs and many algorithmic results. These are surveyed in the new Epilogue chapter in this second edition. New edition of the "Classic" book on the topic. Wonderful introduction to a rich research area Leading author in the field of algorithmic graph theory. Beautifully written for the new mathematician or computer scientist. Comprehensive treatment</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graphes parfaits</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Perfect graphs</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Grafentheorie</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Teoria dos grafos</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computabilidade e complexidade</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Programação matemática</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Programação inteira e fluxos em rede</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Perfect graphs</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</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="689" ind1="1" ind2="0"><subfield code="a">Graph</subfield><subfield code="0">(DE-588)4021842-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://www.sciencedirect.com/science/book/9780444515308</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-027754331</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><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\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.BV042317341 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:18:16Z |
| institution | BVB |
| isbn | 9780444515308 0444515305 0080526969 9780080526966 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027754331 |
| oclc_num | 162579997 |
| open_access_boolean | |
| owner | DE-1046 |
| owner_facet | DE-1046 |
| physical | 1 Online-Ressource (xxvi, 314 pages) |
| psigel | ZDB-33-ESD ZDB-33-EBS FAW_PDA_ESD FLA_PDA_ESD |
| publishDate | 2004 |
| publishDateSearch | 2004 |
| publishDateSort | 2004 |
| publisher | Elsevier |
| record_format | marc |
| series2 | Annals of discrete mathematics |
| spelling | Golumbic, Martin Charles Verfasser aut Algorithmic graph theory and perfect graphs Martin Charles Golumbic Amsterdam Elsevier 2004 1 Online-Ressource (xxvi, 314 pages) txt rdacontent c rdamedia cr rdacarrier Annals of discrete mathematics 57 Algorithmic Graph Theory and Perfect Graphs, first published in 1980, has become the classic introduction to the field. This new Annals edition continues to convey the message that intersection graph models are a necessary and important tool for solving real-world problems. It remains a stepping stone from which the reader may embark on one of many fascinating research trails. The past twenty years have been an amazingly fruitful period of research in algorithmic graph theory and structured families of graphs. Especially important have been the theory and applications of new intersection graph models such as generalizations of permutation graphs and interval graphs. These have lead to new families of perfect graphs and many algorithmic results. These are surveyed in the new Epilogue chapter in this second edition. New edition of the "Classic" book on the topic. Wonderful introduction to a rich research area Leading author in the field of algorithmic graph theory. Beautifully written for the new mathematician or computer scientist. Comprehensive treatment Includes bibliographical references and index Graphes parfaits Perfect graphs fast Grafentheorie gtt Teoria dos grafos larpcal Computabilidade e complexidade larpcal Programação matemática larpcal Programação inteira e fluxos em rede larpcal Perfect graphs Graph (DE-588)4021842-9 gnd rswk-swf Graphentheorie (DE-588)4113782-6 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Graphentheorie (DE-588)4113782-6 s Komplexitätstheorie (DE-588)4120591-1 s 1\p DE-604 Graph (DE-588)4021842-9 s 2\p DE-604 http://www.sciencedirect.com/science/book/9780444515308 Verlag Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Golumbic, Martin Charles Algorithmic graph theory and perfect graphs Graphes parfaits Perfect graphs fast Grafentheorie gtt Teoria dos grafos larpcal Computabilidade e complexidade larpcal Programação matemática larpcal Programação inteira e fluxos em rede larpcal Perfect graphs Graph (DE-588)4021842-9 gnd Graphentheorie (DE-588)4113782-6 gnd Komplexitätstheorie (DE-588)4120591-1 gnd |
| subject_GND | (DE-588)4021842-9 (DE-588)4113782-6 (DE-588)4120591-1 |
| title | Algorithmic graph theory and perfect graphs |
| title_auth | Algorithmic graph theory and perfect graphs |
| title_exact_search | Algorithmic graph theory and perfect graphs |
| title_full | Algorithmic graph theory and perfect graphs Martin Charles Golumbic |
| title_fullStr | Algorithmic graph theory and perfect graphs Martin Charles Golumbic |
| title_full_unstemmed | Algorithmic graph theory and perfect graphs Martin Charles Golumbic |
| title_short | Algorithmic graph theory and perfect graphs |
| title_sort | algorithmic graph theory and perfect graphs |
| topic | Graphes parfaits Perfect graphs fast Grafentheorie gtt Teoria dos grafos larpcal Computabilidade e complexidade larpcal Programação matemática larpcal Programação inteira e fluxos em rede larpcal Perfect graphs Graph (DE-588)4021842-9 gnd Graphentheorie (DE-588)4113782-6 gnd Komplexitätstheorie (DE-588)4120591-1 gnd |
| topic_facet | Graphes parfaits Perfect graphs Grafentheorie Teoria dos grafos Computabilidade e complexidade Programação matemática Programação inteira e fluxos em rede Graph Graphentheorie Komplexitätstheorie |
| url | http://www.sciencedirect.com/science/book/9780444515308 |
| work_keys_str_mv | AT golumbicmartincharles algorithmicgraphtheoryandperfectgraphs |