Algorithmic graph theory and perfect graphs /
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 sto...
Saved in:
| Main Author: | |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Amsterdam ; Boston :
Elsevier,
2004.
|
| Series: | Annals of discrete mathematics ;
57. |
| Subjects: | |
| Online Access: | CONNECT |
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | in00006552575 | ||
| 006 | m o d | ||
| 007 | cr cn||||||||| | ||
| 008 | 070806s2004 ne a ob 001 0 eng d | ||
| 005 | 20240708134629.6 | ||
| 035 | |a 1WRLDSHRocn162579997 | ||
| 040 | |a OPELS |b eng |e pn |c OPELS |d OPELS |d OCLCQ |d MERUC |d DEBBG |d E7B |d IDEBK |d OCLCQ |d OCLCF |d OCLCQ |d OCLCO |d DEBSZ |d NRU |d OCLCQ |d COO |d OCLCQ |d FEM |d OCLCQ |d STF |d D6H |d OCLCQ |d WYU |d LEAUB |d OL$ |d VT2 |d BWN |d OCLCQ |d OCLCO |d COM |d OCLCQ |d OCLCO |d OCLCL | ||
| 019 | |a 441800657 |a 647654772 |a 704436657 |a 968077211 |a 968997414 |a 989426914 |a 1035660683 |a 1066518059 |a 1103260940 |a 1110328069 |a 1129362076 |a 1153020873 | ||
| 020 | |a 9780444515308 | ||
| 020 | |a 0444515305 | ||
| 020 | |a 0080526969 |q (electronic bk.) | ||
| 020 | |a 9780080526966 |q (electronic bk.) | ||
| 035 | |a (OCoLC)162579997 |z (OCoLC)441800657 |z (OCoLC)647654772 |z (OCoLC)704436657 |z (OCoLC)968077211 |z (OCoLC)968997414 |z (OCoLC)989426914 |z (OCoLC)1035660683 |z (OCoLC)1066518059 |z (OCoLC)1103260940 |z (OCoLC)1110328069 |z (OCoLC)1129362076 |z (OCoLC)1153020873 | ||
| 037 | |a 108382:108427 |b Elsevier Science & Technology |n http://www.sciencedirect.com | ||
| 050 | 4 | |a QA166 |b .G64 2004eb | |
| 082 | 0 | 4 | |a 511/.5 |2 22 |
| 049 | |a TXMM | ||
| 100 | 1 | |a Golumbic, Martin Charles. | |
| 245 | 1 | 0 | |a Algorithmic graph theory and perfect graphs / |c Martin Charles Golumbic. |
| 260 | |a Amsterdam ; |a Boston : |b Elsevier, |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 | ||
| 347 | |a text file | ||
| 490 | 1 | |a Annals of discrete mathematics ; |v 57 | |
| 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 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 | ||
| 504 | |a Includes bibliographical references and index. | ||
| 505 | 0 | |a Graph Theoretic Foundations -- The Design of Efficient Algorithms -- Perfect Graphs -- Triangulated Graphs -- Comparability Graphs -- Split Graphs -- Permutation Graphs -- Interval Graphs -- Superperfect Graphs -- Threshold Graphs -- Not So Perfect Graphs -- Perfect Gaussin Elimination. | |
| 588 | 0 | |a Print version record. | |
| 500 | |a ScienceDirect eBook - Mathematics pre-2007 (Elsevier and Woodhead) |5 TMurS | ||
| 650 | 0 | |a Perfect graphs. | |
| 730 | 0 | |a WORLDSHARE SUB RECORDS | |
| 758 | |i has work: |a Algorithmic graph theory and perfect graphs (Text) |1 https://id.oclc.org/worldcat/entity/E39PCFWTcQbDR43McmPtP9Jfmb |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
| 776 | 0 | 8 | |i Print version: |a Golumbic, Martin Charles. |t Algorithmic graph theory and perfect graphs. |d Amsterdam ; Boston : Elsevier, 2004 |z 0444515305 |z 9780444515308 |w (DLC) 2004555477 |w (OCoLC)55081039 |
| 830 | 0 | |a Annals of discrete mathematics ; |v 57. | |
| 856 | 4 | 0 | |u https://ezproxy.mtsu.edu/login?url=https://www.sciencedirect.com/science/bookseries/01675060/57 |z CONNECT |3 Elsevier |t 0 |
| 949 | |a ho0 | ||
| 994 | |a 92 |b TXM | ||
| 998 | |a wi |d z | ||
| 999 | f | f | |s 0b00dc0f-73fc-4f47-955a-cdfb16b42aa4 |i 3011a638-1c6c-4ab8-b669-318e8ae0d4bc |t 0 |
| 952 | f | f | |a Middle Tennessee State University |b Main |c James E. Walker Library |d Electronic Resources |t 0 |e QA166 .G64 2004eb |h Library of Congress classification |
