Algorithmic graph theory and perfect graphs
(eBook)
Author
Published
Amsterdam ; Boston : Elsevier, 2004.
Format
eBook
Edition
2nd ed.
ISBN
9780080526966, 0080526969, 0444515305, 9780444515308
Physical Desc
1 online resource (xxvi, 314 pages) : illustrations
Status
Description
Loading Description...
Also in this Series
Checking series information...
Subjects
LC Subjects
Bisac Subjects
OCLC Fast Subjects
More Details
Language
English
Notes
Bibliography
Includes bibliographical references and index.
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.
Local note
O'Reilly,O'Reilly Online Learning: Academic/Public Library Edition
Reviews from GoodReads
Loading GoodReads Reviews.
Citations
APA Citation, 7th Edition (style guide)
Golumbic, M. C. (2004). Algorithmic graph theory and perfect graphs (2nd ed.). Elsevier.
Chicago / Turabian - Author Date Citation, 17th Edition (style guide)Golumbic, Martin Charles. 2004. Algorithmic Graph Theory and Perfect Graphs. Elsevier.
Chicago / Turabian - Humanities (Notes and Bibliography) Citation, 17th Edition (style guide)Golumbic, Martin Charles. Algorithmic Graph Theory and Perfect Graphs Elsevier, 2004.
MLA Citation, 9th Edition (style guide)Golumbic, Martin Charles. Algorithmic Graph Theory and Perfect Graphs 2nd ed., Elsevier, 2004.
Note! Citations contain only title, author, edition, publisher, and year published. Citations should be used as a guideline and should be double checked for accuracy. Citation formats are based on standards as of August 2021.
Staff View
Grouped Work ID
b361d667-b5ba-8461-6a90-b9f78a93cf5e-eng
Grouping Information
Grouped Work ID | b361d667-b5ba-8461-6a90-b9f78a93cf5e-eng |
---|---|
Full title | algorithmic graph theory and perfect graphs |
Author | golumbic martin charles |
Grouping Category | book |
Last Update | 2023-12-11 15:41:25PM |
Last Indexed | 2024-03-29 03:39:02AM |
Book Cover Information
Image Source | syndetics |
---|---|
First Loaded | Jul 5, 2022 |
Last Used | Mar 21, 2024 |
Marc Record
First Detected | Nov 09, 2022 03:38:03 PM |
---|---|
Last File Modification Time | Dec 11, 2023 03:43:08 PM |
MARC Record
LEADER | 04153cam a2200745 a 4500 | ||
---|---|---|---|
001 | ocn175281566 | ||
003 | OCoLC | ||
005 | 20231006123411.0 | ||
006 | m o d | ||
007 | cr cnu---unuuu | ||
008 | 071019s2004 ne a ob 001 0 eng d | ||
015 | |a GBB986493|2 bnb | ||
016 | 7 | |a 017584125|2 Uk | |
019 | |a 900796223 | ||
020 | |a 9780080526966|q (electronic bk.) | ||
020 | |a 0080526969|q (electronic bk.) | ||
020 | |a 0444515305 | ||
020 | |a 9780444515308 | ||
020 | |z 9780444515308 | ||
029 | 1 | |a AU@|b 000062578240 | |
029 | 1 | |a DEBBG|b BV042491052 | |
029 | 1 | |a DEBSZ|b 43043975X | |
029 | 1 | |a DEBSZ|b 43484229X | |
029 | 1 | |a DEBSZ|b 449104389 | |
029 | 1 | |a GBVCP|b 882845489 | |
029 | 1 | |a UKMGB|b 017584125 | |
029 | 1 | |a DKDLA|b 820120-katalog:9910110293005765 | |
035 | |a (OCoLC)175281566|z (OCoLC)900796223 | ||
037 | |a CL0500000544|b Safari Books Online | ||
040 | |a N$T|b eng|e pn|c N$T|d YDXCP|d OCLCQ|d EBLCP|d OCLCQ|d MHW|d OCLCQ|d OCLCO|d OCLCQ|d OCLCF|d OCLCQ|d UMI|d DEBBG|d DEBSZ|d OCLCQ|d MERUC|d CEF|d OCLCQ|d UAB|d UKMGB|d OCLCQ|d NLW|d OCLCO|d OCLCQ|d KSU|d OCLCQ | ||
049 | |a TKLA | ||
050 | 4 | |a QA166|b .G64 2004eb | |
072 | 7 | |a MAT|x 013000|2 bisacsh | |
082 | 0 | 4 | |a 511/.5|2 22 |
100 | 1 | |a Golumbic, Martin Charles.|0 http://id.loc.gov/authorities/names/n79123357 | |
245 | 1 | 0 | |a Algorithmic graph theory and perfect graphs /|c Martin Charles Golumbic. |
250 | |a 2nd ed. | ||
260 | |a Amsterdam ;|a Boston :|b Elsevier,|c 2004. | ||
264 | 4 | |c ©2004 | |
300 | |a 1 online resource (xxvi, 314 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 Annals of discrete mathematics ;|v 57 | |
504 | |a Includes bibliographical references and index. | ||
505 | 0 | |a Cover; Contents; Foreword 2004; Foreword; Preface; Acknowledgments; List of Symbols; Corrections and Errata; Chapter 1. Graph Theoretic Foundations; Chapter 2. The Design of Efficient Algorithms; Chapter 3. Perfect Graphs; Chapter 4. Triangulated Graphs; Chapter 5. Comparability Graphs; Chapter 6. Split Graphs; Chapter 7. Permutation Graphs; Chapter 8. Interval Graphs; Chapter 9. Superperfect Graphs; Chapter 10. Threshold Graphs; Chapter 11. Not So Perfect Graphs; Chapter 12. Perfect Gaussian Elimination; Appendix; Epilogue 2004; Index. | |
520 | |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. | ||
588 | 0 | |a Print version record. | |
590 | |a O'Reilly|b O'Reilly Online Learning: Academic/Public Library Edition | ||
650 | 0 | |a Perfect graphs.|0 http://id.loc.gov/authorities/subjects/sh85099790 | |
650 | 6 | |a Graphes parfaits. | |
650 | 7 | |a MATHEMATICS|x Graphic Methods.|2 bisacsh | |
650 | 7 | |a Perfect graphs.|2 fast|0 (OCoLC)fst01057796 | |
650 | 1 | 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 | |
776 | 0 | 8 | |i Print version:|a Golumbic, Martin Charles.|t Algorithmic graph theory and perfect graphs.|b 2nd ed.|d Amsterdam ; Boston : Elsevier, 2004|z 0444515305|z 9780444515308|w (DLC) 2004555477|w (OCoLC)55081039 |
830 | 0 | |a Annals of discrete mathematics ;|v 57.|0 http://id.loc.gov/authorities/names/n42002128 | |
856 | 4 | 0 | |u https://ezproxy.knoxlib.org/login?url=https://learning.oreilly.com/library/view/~/9780444515308/?ar |
938 | |a EBL - Ebook Library|b EBLB|n EBL313977 | ||
938 | |a EBSCOhost|b EBSC|n 207476 | ||
938 | |a YBP Library Services|b YANK|n 2718856 | ||
994 | |a 92|b TKL |