Tolerance graphs:
The study of algorithmic graph theory and structured families of graphs is an important branch of discrete mathematics. It finds numerous applications, from data transmission through networks to efficiently scheduling aircraft and crews, as well as contributing to breakthroughs in genetic analysis a...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2004
|
| Schriftenreihe: | Cambridge studies in advanced mathematics
89 |
| Schlagworte: | |
| Online-Zugang: | BSB01 FHN01 UBR01 Volltext |
| Zusammenfassung: | The study of algorithmic graph theory and structured families of graphs is an important branch of discrete mathematics. It finds numerous applications, from data transmission through networks to efficiently scheduling aircraft and crews, as well as contributing to breakthroughs in genetic analysis and studies of the brain. Especially important have been the theory and applications of new intersection graph models such as generalizations of permutation graphs and interval graphs. One of these is the study of tolerance graphs and tolerance orders. This book contains the first thorough study of tolerance graphs and related topics, indeed the authors have included proofs of major results previously unpublished in book form. It will act as a springboard for researchers, and especially graduate students, to pursue new directions of investigation. With many examples and exercises it is also suitable for use as the text for a graduate course in graph theory |
| Beschreibung: | Title from publisher's bibliographic system (viewed on 05 Oct 2015) |
| Beschreibung: | 1 online resource (xii, 265 Seiten) |
| ISBN: | 9780511542985 |
| DOI: | 10.1017/CBO9780511542985 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV043941875 | ||
| 003 | DE-604 | ||
| 005 | 20190220 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 161206s2004 |||| o||u| ||||||eng d | ||
| 020 | |a 9780511542985 |c Online |9 978-0-511-54298-5 | ||
| 024 | 7 | |a 10.1017/CBO9780511542985 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9780511542985 | ||
| 035 | |a (OCoLC)850253412 | ||
| 035 | |a (DE-599)BVBBV043941875 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 |a DE-355 | ||
| 082 | 0 | |a 511.5 |2 22 | |
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 100 | 1 | |a Golumbic, Martin Charles |d 1948- |e Verfasser |0 (DE-588)1089493622 |4 aut | |
| 245 | 1 | 0 | |a Tolerance graphs |c Martin Charles Golumbic, Ann N. Trenk |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2004 | |
| 300 | |a 1 online resource (xii, 265 Seiten) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Cambridge studies in advanced mathematics |v 89 | |
| 500 | |a Title from publisher's bibliographic system (viewed on 05 Oct 2015) | ||
| 520 | |a The study of algorithmic graph theory and structured families of graphs is an important branch of discrete mathematics. It finds numerous applications, from data transmission through networks to efficiently scheduling aircraft and crews, as well as contributing to breakthroughs in genetic analysis and studies of the brain. Especially important have been the theory and applications of new intersection graph models such as generalizations of permutation graphs and interval graphs. One of these is the study of tolerance graphs and tolerance orders. This book contains the first thorough study of tolerance graphs and related topics, indeed the authors have included proofs of major results previously unpublished in book form. It will act as a springboard for researchers, and especially graduate students, to pursue new directions of investigation. With many examples and exercises it is also suitable for use as the text for a graduate course in graph theory | ||
| 650 | 4 | |a Graph theory | |
| 650 | 0 | 7 | |a Intervallgraph |0 (DE-588)4162152-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Strukturbaum |0 (DE-588)4183789-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Bipartiter Graph |0 (DE-588)4145661-0 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Intervallgraph |0 (DE-588)4162152-9 |D s |
| 689 | 0 | 1 | |a Bipartiter Graph |0 (DE-588)4145661-0 |D s |
| 689 | 0 | 2 | |a Strukturbaum |0 (DE-588)4183789-7 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Trenk, Ann N. |e Sonstige |0 (DE-588)112756398X |4 oth | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 978-0-521-82758-4 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/CBO9780511542985 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029350845 | ||
| 966 | e | |u https://doi.org/10.1017/CBO9780511542985 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511542985 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511542985 |l UBR01 |p ZDB-20-CBO |q UBR Einzelkauf (Lückenergänzung CUP Serien 2018) |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804176884127236096 |
|---|---|
| any_adam_object | |
| author | Golumbic, Martin Charles 1948- |
| author_GND | (DE-588)1089493622 (DE-588)112756398X |
| 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 | BV043941875 |
| classification_rvk | SK 890 |
| collection | ZDB-20-CBO |
| ctrlnum | (ZDB-20-CBO)CR9780511542985 (OCoLC)850253412 (DE-599)BVBBV043941875 |
| 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 | Mathematik |
| doi_str_mv | 10.1017/CBO9780511542985 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03129nmm a2200517zcb4500</leader><controlfield tag="001">BV043941875</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20190220 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161206s2004 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511542985</subfield><subfield code="c">Online</subfield><subfield code="9">978-0-511-54298-5</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9780511542985</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9780511542985</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)850253412</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043941875</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-355</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.5</subfield><subfield code="2">22</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="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">Tolerance graphs</subfield><subfield code="c">Martin Charles Golumbic, Ann N. Trenk</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2004</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xii, 265 Seiten)</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">Cambridge studies in advanced mathematics</subfield><subfield code="v">89</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 05 Oct 2015)</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The study of algorithmic graph theory and structured families of graphs is an important branch of discrete mathematics. It finds numerous applications, from data transmission through networks to efficiently scheduling aircraft and crews, as well as contributing to breakthroughs in genetic analysis and studies of the brain. Especially important have been the theory and applications of new intersection graph models such as generalizations of permutation graphs and interval graphs. One of these is the study of tolerance graphs and tolerance orders. This book contains the first thorough study of tolerance graphs and related topics, indeed the authors have included proofs of major results previously unpublished in book form. It will act as a springboard for researchers, and especially graduate students, to pursue new directions of investigation. With many examples and exercises it is also suitable for use as the text for a graduate course in graph theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Intervallgraph</subfield><subfield code="0">(DE-588)4162152-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Strukturbaum</subfield><subfield code="0">(DE-588)4183789-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Bipartiter Graph</subfield><subfield code="0">(DE-588)4145661-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Intervallgraph</subfield><subfield code="0">(DE-588)4162152-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Bipartiter Graph</subfield><subfield code="0">(DE-588)4145661-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Strukturbaum</subfield><subfield code="0">(DE-588)4183789-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Trenk, Ann N.</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)112756398X</subfield><subfield code="4">oth</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">978-0-521-82758-4</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9780511542985</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029350845</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511542985</subfield><subfield code="l">BSB01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511542985</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511542985</subfield><subfield code="l">UBR01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">UBR Einzelkauf (Lückenergänzung CUP Serien 2018)</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV043941875 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:39:16Z |
| institution | BVB |
| isbn | 9780511542985 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029350845 |
| oclc_num | 850253412 |
| open_access_boolean | |
| owner | DE-12 DE-92 DE-355 DE-BY-UBR |
| owner_facet | DE-12 DE-92 DE-355 DE-BY-UBR |
| physical | 1 online resource (xii, 265 Seiten) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO ZDB-20-CBO UBR Einzelkauf (Lückenergänzung CUP Serien 2018) |
| publishDate | 2004 |
| publishDateSearch | 2004 |
| publishDateSort | 2004 |
| publisher | Cambridge University Press |
| record_format | marc |
| series2 | Cambridge studies in advanced mathematics |
| spelling | Golumbic, Martin Charles 1948- Verfasser (DE-588)1089493622 aut Tolerance graphs Martin Charles Golumbic, Ann N. Trenk Cambridge Cambridge University Press 2004 1 online resource (xii, 265 Seiten) txt rdacontent c rdamedia cr rdacarrier Cambridge studies in advanced mathematics 89 Title from publisher's bibliographic system (viewed on 05 Oct 2015) The study of algorithmic graph theory and structured families of graphs is an important branch of discrete mathematics. It finds numerous applications, from data transmission through networks to efficiently scheduling aircraft and crews, as well as contributing to breakthroughs in genetic analysis and studies of the brain. Especially important have been the theory and applications of new intersection graph models such as generalizations of permutation graphs and interval graphs. One of these is the study of tolerance graphs and tolerance orders. This book contains the first thorough study of tolerance graphs and related topics, indeed the authors have included proofs of major results previously unpublished in book form. It will act as a springboard for researchers, and especially graduate students, to pursue new directions of investigation. With many examples and exercises it is also suitable for use as the text for a graduate course in graph theory Graph theory Intervallgraph (DE-588)4162152-9 gnd rswk-swf Strukturbaum (DE-588)4183789-7 gnd rswk-swf Bipartiter Graph (DE-588)4145661-0 gnd rswk-swf Intervallgraph (DE-588)4162152-9 s Bipartiter Graph (DE-588)4145661-0 s Strukturbaum (DE-588)4183789-7 s DE-604 Trenk, Ann N. Sonstige (DE-588)112756398X oth Erscheint auch als Druck-Ausgabe 978-0-521-82758-4 https://doi.org/10.1017/CBO9780511542985 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Golumbic, Martin Charles 1948- Tolerance graphs Graph theory Intervallgraph (DE-588)4162152-9 gnd Strukturbaum (DE-588)4183789-7 gnd Bipartiter Graph (DE-588)4145661-0 gnd |
| subject_GND | (DE-588)4162152-9 (DE-588)4183789-7 (DE-588)4145661-0 |
| title | Tolerance graphs |
| title_auth | Tolerance graphs |
| title_exact_search | Tolerance graphs |
| title_full | Tolerance graphs Martin Charles Golumbic, Ann N. Trenk |
| title_fullStr | Tolerance graphs Martin Charles Golumbic, Ann N. Trenk |
| title_full_unstemmed | Tolerance graphs Martin Charles Golumbic, Ann N. Trenk |
| title_short | Tolerance graphs |
| title_sort | tolerance graphs |
| topic | Graph theory Intervallgraph (DE-588)4162152-9 gnd Strukturbaum (DE-588)4183789-7 gnd Bipartiter Graph (DE-588)4145661-0 gnd |
| topic_facet | Graph theory Intervallgraph Strukturbaum Bipartiter Graph |
| url | https://doi.org/10.1017/CBO9780511542985 |
| work_keys_str_mv | AT golumbicmartincharles tolerancegraphs AT trenkannn tolerancegraphs |