Algorithmic graph theory and perfect graphs:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam [u.a.]
Elsevier
2004
|
| Ausgabe: | 2. ed. |
| Schriftenreihe: | Annals of discrete mathematics
57 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Literaturangaben 299 - 304 |
| Beschreibung: | XXVI, 314 Seiten Diagramme |
| ISBN: | 0444515305 |
Internformat
MARC
| LEADER | 00000nam a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV022103093 | ||
| 003 | DE-604 | ||
| 005 | 20240306 | ||
| 007 | t | ||
| 008 | 040304s2004 |||| |||| 00||| eng d | ||
| 020 | |a 0444515305 |9 0-444-51530-5 | ||
| 035 | |a (OCoLC)55081039 | ||
| 035 | |a (DE-599)BVBBV022103093 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 |a DE-83 |a DE-634 |a DE-91G |a DE-739 | ||
| 050 | 0 | |a QA166 | |
| 082 | 0 | |a 511.5 |2 21 | |
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a MAT 055f |2 stub | ||
| 084 | |a 05Cxx |2 msc | ||
| 100 | 1 | |a Golumbic, Martin Charles |d 1948- |e Verfasser |0 (DE-588)1089493622 |4 aut | |
| 245 | 1 | 0 | |a Algorithmic graph theory and perfect graphs |c Martin Charles Golumbic |
| 250 | |a 2. ed. | ||
| 264 | 1 | |a Amsterdam [u.a.] |b Elsevier |c 2004 | |
| 300 | |a XXVI, 314 Seiten |b Diagramme | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Annals of discrete mathematics |v 57 | |
| 500 | |a Literaturangaben 299 - 304 | ||
| 650 | 4 | |a Perfect graphs | |
| 650 | 0 | 7 | |a Graph |0 (DE-588)4021842-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Graph |0 (DE-588)4021842-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
| 689 | 1 | 1 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 1 | |5 DE-604 | |
| 830 | 0 | |a Annals of discrete mathematics |v 57 |w (DE-604)BV004511910 |9 57 | |
| 856 | 4 | 2 | |m Digitalisierung UB Passau - ADAM Catalogue Enrichment |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015317969&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015317969 | ||
Datensatz im Suchindex
| _version_ | 1804136077779271680 |
|---|---|
| adam_text | Contents Foreword 2004 xiii Foreword xv Preface xvii Acknowledgments xix List ofSymbols xxi Corrections and Errata CHAPTER 1 Graph Theoretic Foundations 1. 2. 3. 4. CHAPTER 2 xxiii Basic Definitions and Notations Intersection Graphs Interval Graphs—A Sneak Preview of the Notions Coming Up Summary Exercises Bibliography 1 9 13 17 18 20 The Design of Efficient Algorithms 1. 2. 3. 4. The Complexity of Computer Algorithms Data Structures How to Explore a Graph Transitive Tournaments and Topological Sorting Exercises Bibliography 22 31 37 42 45 48 vii
viii chapter Contents 3 Perfect Graphs 1. 2. 3. 4. 5. 6. chapter 4 4. 5. 6. 7. 5 51 53 58 62 65 71 75 77 Triangulated Graphs 1. 2. 3. chapter The Star of the Show The Perfect Graph Theorem p-Critical and Partitionable Graphs A Polyhedral Characterization of Perfect Graphs A Polyhedral Characterization of p-Critical Graphs The Strong Perfect Graph Conjecture Exercises Bibliography Introduction Characterizing Triangulated Graphs Recognizing Triangulated Graphs by Lexicographic Breadth-First Search The Complexity of Recognizing Triangulated Graphs Triangulated Graphs as Intersection Graphs Triangulated Graphs Are Perfect Fast Algorithms for the COLORING, CLIQUE, STABLE SET, and CLIQUE-COVER Problems on Triangulated Graphs Exercises Bibliography 81 81 84 87 91 94 98 100 102 Comparability Graphs 1. 2. 3. 4. 5. 6. 7. Г-Chains and Implication Classes Uniquely Partially Orderable Graphs The Number of Transitive Orientations Schemes and G-Decompositions—An Algorithm for Assigning Transitive Orientations The r*-Matroid of a Graph The Complexity of Comparability Graph Recognition Coloring and Other Problems on Comparability Graphs 105 109 113 120 124 129 132
Contents ¡X 8. CHAPTER 6 2. 3. 7 8 9 149 149 152 155 156 Introduction Characterizing Permutation Graphs Permutation Labelings Applications Sorting a Permutation Using Queues in Parallel Exercises Bibliography 157 158 160 162 164 168 169 Interval Graphs 1. 2. 3. 4. 5. 6. chapter An Introduction to Chapters 6-8: Interval, Permutation, and Split Graphs Characterizing Split Graphs Degree Sequences and Split Graphs Exercises Bibliography Permutation Graphs 1. 2. 3. 4. 5. chapter 135 139 142 Split Graphs 1. chapter The Dimension of Partial Orders Exercises Bibliography How It All Started Some Characterizations of Interval Graphs The Complexity of Consecutive l’s Testing Applications of Interval Graphs Preference and Indifference Circular-Arc Graphs Exercises Bibliography 171 172 175 181 185 188 193 197 Superperfect Graphs 1. 2. 3. Coloring Weighted Graphs Superperfection An Infinite Class of Superperfect Noncomparability Graphs 203 206 209
x Contents 4. 5. 6. chapter 10 11 2. 3. 4. 5. 12 215 218 218 The Threshold Dimension Degree Partition of Threshold Graphs A Characterization Using Permutations An Application to Synchronizing Parallel Processes Exercises Bibliography 219 223 227 229 231 234 Not So Perfect Graphs 1. chapter 212 214 Threshold Graphs 1. 2. 3. 4. chapter When Does Superperfect EqualComparability? Composition of Superperfect Graphs A Representation Using the Consecutive 1 ’s Property Exercises Bibliography Sorting a Permutation Using Stacks in Parallel Intersecting Chords of a Circle Overlap Graphs Fast Algorithms for Maximum Stable Set and Maximum Clique of These Not So Perfect Graphs A Graph Theoretic Characterization of Overlap Graphs Exercises Bibliography 235 237 242 244 248 251 253 Perfect Gaussian Elimination 1. Perfect Elimination Matrices 2. Symmetric Matrices 3. Perfect Elimination Bipartite Graphs 4. Chordal Bipartite Graphs Exercises Bibliography 254 256 259 261 264 266
xi Contents Appendix A. B. C. D. E. F. A Small Collection of NP-Complete Problems An Algorithm for Set Union, Intersection, Difference, and Symmetric Difference of 1 vo Subsets Topological Sorting: An Example of Algorithm 2.4 An Illustration of the Decomposition Algorithm The Properties P.E.B., C.B., (P.E.B.) , (C.B.) Illustrated The Properties C, C, T, T Illustrated 269 270 271 273 273 275 Epilogue 2004 277 Index 307
|
| adam_txt |
Contents Foreword 2004 xiii Foreword xv Preface xvii Acknowledgments xix List ofSymbols xxi Corrections and Errata CHAPTER 1 Graph Theoretic Foundations 1. 2. 3. 4. CHAPTER 2 xxiii Basic Definitions and Notations Intersection Graphs Interval Graphs—A Sneak Preview of the Notions Coming Up Summary Exercises Bibliography 1 9 13 17 18 20 The Design of Efficient Algorithms 1. 2. 3. 4. The Complexity of Computer Algorithms Data Structures How to Explore a Graph Transitive Tournaments and Topological Sorting Exercises Bibliography 22 31 37 42 45 48 vii
viii chapter Contents 3 Perfect Graphs 1. 2. 3. 4. 5. 6. chapter 4 4. 5. 6. 7. 5 51 53 58 62 65 71 75 77 Triangulated Graphs 1. 2. 3. chapter The Star of the Show The Perfect Graph Theorem p-Critical and Partitionable Graphs A Polyhedral Characterization of Perfect Graphs A Polyhedral Characterization of p-Critical Graphs The Strong Perfect Graph Conjecture Exercises Bibliography Introduction Characterizing Triangulated Graphs Recognizing Triangulated Graphs by Lexicographic Breadth-First Search The Complexity of Recognizing Triangulated Graphs Triangulated Graphs as Intersection Graphs Triangulated Graphs Are Perfect Fast Algorithms for the COLORING, CLIQUE, STABLE SET, and CLIQUE-COVER Problems on Triangulated Graphs Exercises Bibliography 81 81 84 87 91 94 98 100 102 Comparability Graphs 1. 2. 3. 4. 5. 6. 7. Г-Chains and Implication Classes Uniquely Partially Orderable Graphs The Number of Transitive Orientations Schemes and G-Decompositions—An Algorithm for Assigning Transitive Orientations The r*-Matroid of a Graph The Complexity of Comparability Graph Recognition Coloring and Other Problems on Comparability Graphs 105 109 113 120 124 129 132
Contents ¡X 8. CHAPTER 6 2. 3. 7 8 9 149 149 152 155 156 Introduction Characterizing Permutation Graphs Permutation Labelings Applications Sorting a Permutation Using Queues in Parallel Exercises Bibliography 157 158 160 162 164 168 169 Interval Graphs 1. 2. 3. 4. 5. 6. chapter An Introduction to Chapters 6-8: Interval, Permutation, and Split Graphs Characterizing Split Graphs Degree Sequences and Split Graphs Exercises Bibliography Permutation Graphs 1. 2. 3. 4. 5. chapter 135 139 142 Split Graphs 1. chapter The Dimension of Partial Orders Exercises Bibliography How It All Started Some Characterizations of Interval Graphs The Complexity of Consecutive l’s Testing Applications of Interval Graphs Preference and Indifference Circular-Arc Graphs Exercises Bibliography 171 172 175 181 185 188 193 197 Superperfect Graphs 1. 2. 3. Coloring Weighted Graphs Superperfection An Infinite Class of Superperfect Noncomparability Graphs 203 206 209
x Contents 4. 5. 6. chapter 10 11 2. 3. 4. 5. 12 215 218 218 The Threshold Dimension Degree Partition of Threshold Graphs A Characterization Using Permutations An Application to Synchronizing Parallel Processes Exercises Bibliography 219 223 227 229 231 234 Not So Perfect Graphs 1. chapter 212 214 Threshold Graphs 1. 2. 3. 4. chapter When Does Superperfect EqualComparability? Composition of Superperfect Graphs A Representation Using the Consecutive 1 ’s Property Exercises Bibliography Sorting a Permutation Using Stacks in Parallel Intersecting Chords of a Circle Overlap Graphs Fast Algorithms for Maximum Stable Set and Maximum Clique of These Not So Perfect Graphs A Graph Theoretic Characterization of Overlap Graphs Exercises Bibliography 235 237 242 244 248 251 253 Perfect Gaussian Elimination 1. Perfect Elimination Matrices 2. Symmetric Matrices 3. Perfect Elimination Bipartite Graphs 4. Chordal Bipartite Graphs Exercises Bibliography 254 256 259 261 264 266
xi Contents Appendix A. B. C. D. E. F. A Small Collection of NP-Complete Problems An Algorithm for Set Union, Intersection, Difference, and Symmetric Difference of 1\vo Subsets Topological Sorting: An Example of Algorithm 2.4 An Illustration of the Decomposition Algorithm The Properties P.E.B., C.B., (P.E.B.)', (C.B.)' Illustrated The Properties C, C, T, T Illustrated 269 270 271 273 273 275 Epilogue 2004 277 Index 307 |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Golumbic, Martin Charles 1948- |
| author_GND | (DE-588)1089493622 |
| author_facet | Golumbic, Martin Charles 1948- |
| author_role | aut |
| author_sort | Golumbic, Martin Charles 1948- |
| author_variant | m c g mc mcg |
| building | Verbundindex |
| bvnumber | BV022103093 |
| callnumber-first | Q - Science |
| callnumber-label | QA166 |
| callnumber-raw | QA166 |
| callnumber-search | QA166 |
| callnumber-sort | QA 3166 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SK 890 ST 134 |
| classification_tum | MAT 055f |
| ctrlnum | (OCoLC)55081039 (DE-599)BVBBV022103093 |
| 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.5 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| discipline_str_mv | Informatik Mathematik |
| edition | 2. ed. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01880nam a2200493zcb4500</leader><controlfield tag="001">BV022103093</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20240306 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">040304s2004 |||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0444515305</subfield><subfield code="9">0-444-51530-5</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)55081039</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV022103093</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-739</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA166</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.5</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 055f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">05Cxx</subfield><subfield code="2">msc</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Golumbic, Martin Charles</subfield><subfield code="d">1948-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1089493622</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="250" ind1=" " ind2=" "><subfield code="a">2. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam [u.a.]</subfield><subfield code="b">Elsevier</subfield><subfield code="c">2004</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XXVI, 314 Seiten</subfield><subfield code="b">Diagramme</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Annals of discrete mathematics</subfield><subfield code="v">57</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturangaben 299 - 304</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">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="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="689" ind1="0" 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="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" 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="1" 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="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Annals of discrete mathematics</subfield><subfield code="v">57</subfield><subfield code="w">(DE-604)BV004511910</subfield><subfield code="9">57</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Passau - ADAM Catalogue Enrichment</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015317969&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015317969</subfield></datafield></record></collection> |
| id | DE-604.BV022103093 |
| illustrated | Not Illustrated |
| index_date | 2024-07-02T16:15:22Z |
| indexdate | 2024-07-09T20:50:40Z |
| institution | BVB |
| isbn | 0444515305 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015317969 |
| oclc_num | 55081039 |
| open_access_boolean | |
| owner | DE-706 DE-83 DE-634 DE-91G DE-BY-TUM DE-739 |
| owner_facet | DE-706 DE-83 DE-634 DE-91G DE-BY-TUM DE-739 |
| physical | XXVI, 314 Seiten Diagramme |
| publishDate | 2004 |
| publishDateSearch | 2004 |
| publishDateSort | 2004 |
| publisher | Elsevier |
| record_format | marc |
| series | Annals of discrete mathematics |
| series2 | Annals of discrete mathematics |
| spelling | Golumbic, Martin Charles 1948- Verfasser (DE-588)1089493622 aut Algorithmic graph theory and perfect graphs Martin Charles Golumbic 2. ed. Amsterdam [u.a.] Elsevier 2004 XXVI, 314 Seiten Diagramme txt rdacontent n rdamedia nc rdacarrier Annals of discrete mathematics 57 Literaturangaben 299 - 304 Perfect graphs Graph (DE-588)4021842-9 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Graphentheorie (DE-588)4113782-6 gnd rswk-swf Graph (DE-588)4021842-9 s DE-604 Graphentheorie (DE-588)4113782-6 s Komplexitätstheorie (DE-588)4120591-1 s Annals of discrete mathematics 57 (DE-604)BV004511910 57 Digitalisierung UB Passau - ADAM Catalogue Enrichment application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015317969&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Golumbic, Martin Charles 1948- Algorithmic graph theory and perfect graphs Annals of discrete mathematics Perfect graphs Graph (DE-588)4021842-9 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Graphentheorie (DE-588)4113782-6 gnd |
| subject_GND | (DE-588)4021842-9 (DE-588)4120591-1 (DE-588)4113782-6 |
| 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_exact_search_txtP | 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 | Perfect graphs Graph (DE-588)4021842-9 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Graphentheorie (DE-588)4113782-6 gnd |
| topic_facet | Perfect graphs Graph Komplexitätstheorie Graphentheorie |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015317969&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV004511910 |
| work_keys_str_mv | AT golumbicmartincharles algorithmicgraphtheoryandperfectgraphs |