Tolerance graphs:
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Elektronisch E-Book |
Sprache: | English |
Veröffentlicht: |
Cambridge, UK
Cambridge University Press
2004
|
Schriftenreihe: | Cambridge studies in advanced mathematics
89 |
Schlagworte: | |
Beschreibung: | xii, 265 p. |
ISBN: | 0511187459 0521827582 |
Internformat
MARC
LEADER | 00000nmm a2200000zcb4500 | ||
---|---|---|---|
001 | BV044835079 | ||
003 | DE-604 | ||
005 | 20180305 | ||
007 | cr|uuu---uuuuu | ||
008 | 180305s2004 |||| o||u| ||||||eng d | ||
020 | |a 0511187459 |9 0-511-18745-9 | ||
020 | |a 0521827582 |9 0-521-82758-2 | ||
035 | |a (ZDB-38-ESG)ebr10124740 | ||
035 | |a (OCoLC)319033335 | ||
035 | |a (DE-599)BVBBV044835079 | ||
040 | |a DE-604 |b ger |e aacr | ||
041 | 0 | |a eng | |
100 | 1 | |a Golumbic, Martin Charles |e Verfasser |4 aut | |
245 | 1 | 0 | |a Tolerance graphs |c Martin Charles Golumbic, Ann N. Trenk |
264 | 1 | |a Cambridge, UK |b Cambridge University Press |c 2004 | |
300 | |a xii, 265 p. | ||
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 | |
505 | 8 | |a Includes bibliographical references (p. 253-259) and indexes | |
505 | 8 | |a Introduction -- Early work on tolerance graphs -- Trees, cotrees and bipartite graphs -- Interval probe graphs -- Bitolerance graphs and ordered sets -- Unit and 50% tolerance graphs -- Comparability and invariance results -- Bounded bitolerance recognition -- Algorithms on tolerance graphs -- The hierarchy of bitolerance orders -- Tolerance models on trees -- Phi-tolerance models -- Directed tolerance graphs -- Open questions and further directions | |
650 | 4 | |a Graph theory | |
650 | 4 | |a Combinatorial analysis | |
650 | 0 | 7 | |a Bipartiter Graph |0 (DE-588)4145661-0 |2 gnd |9 rswk-swf |
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 |
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 | |8 1\p |5 DE-604 | |
700 | 1 | |a Trenk, Ann N. |e Sonstige |4 oth | |
912 | |a ZDB-38-ESG | ||
999 | |a oai:aleph.bib-bvb.de:BVB01-030229942 | ||
883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk |
Datensatz im Suchindex
_version_ | 1804178338891169792 |
---|---|
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 | BV044835079 |
collection | ZDB-38-ESG |
contents | Includes bibliographical references (p. 253-259) and indexes Introduction -- Early work on tolerance graphs -- Trees, cotrees and bipartite graphs -- Interval probe graphs -- Bitolerance graphs and ordered sets -- Unit and 50% tolerance graphs -- Comparability and invariance results -- Bounded bitolerance recognition -- Algorithms on tolerance graphs -- The hierarchy of bitolerance orders -- Tolerance models on trees -- Phi-tolerance models -- Directed tolerance graphs -- Open questions and further directions |
ctrlnum | (ZDB-38-ESG)ebr10124740 (OCoLC)319033335 (DE-599)BVBBV044835079 |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02010nmm a2200445zcb4500</leader><controlfield tag="001">BV044835079</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20180305 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">180305s2004 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0511187459</subfield><subfield code="9">0-511-18745-9</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521827582</subfield><subfield code="9">0-521-82758-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-38-ESG)ebr10124740</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)319033335</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV044835079</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="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">Tolerance graphs</subfield><subfield code="c">Martin Charles Golumbic, Ann N. Trenk</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, UK</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2004</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xii, 265 p.</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="505" ind1="8" ind2=" "><subfield code="a">Includes bibliographical references (p. 253-259) and indexes</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Introduction -- Early work on tolerance graphs -- Trees, cotrees and bipartite graphs -- Interval probe graphs -- Bitolerance graphs and ordered sets -- Unit and 50% tolerance graphs -- Comparability and invariance results -- Bounded bitolerance recognition -- Algorithms on tolerance graphs -- The hierarchy of bitolerance orders -- Tolerance models on trees -- Phi-tolerance models -- Directed tolerance graphs -- Open questions and further directions</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial analysis</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="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="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="8">1\p</subfield><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="4">oth</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-38-ESG</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-030229942</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></record></collection> |
id | DE-604.BV044835079 |
illustrated | Not Illustrated |
indexdate | 2024-07-10T08:02:23Z |
institution | BVB |
isbn | 0511187459 0521827582 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-030229942 |
oclc_num | 319033335 |
open_access_boolean | |
physical | xii, 265 p. |
psigel | ZDB-38-ESG |
publishDate | 2004 |
publishDateSearch | 2004 |
publishDateSort | 2004 |
publisher | Cambridge University Press |
record_format | marc |
series2 | Cambridge studies in advanced mathematics |
spelling | Golumbic, Martin Charles Verfasser aut Tolerance graphs Martin Charles Golumbic, Ann N. Trenk Cambridge, UK Cambridge University Press 2004 xii, 265 p. txt rdacontent c rdamedia cr rdacarrier Cambridge studies in advanced mathematics 89 Includes bibliographical references (p. 253-259) and indexes Introduction -- Early work on tolerance graphs -- Trees, cotrees and bipartite graphs -- Interval probe graphs -- Bitolerance graphs and ordered sets -- Unit and 50% tolerance graphs -- Comparability and invariance results -- Bounded bitolerance recognition -- Algorithms on tolerance graphs -- The hierarchy of bitolerance orders -- Tolerance models on trees -- Phi-tolerance models -- Directed tolerance graphs -- Open questions and further directions Graph theory Combinatorial analysis Bipartiter Graph (DE-588)4145661-0 gnd rswk-swf Intervallgraph (DE-588)4162152-9 gnd rswk-swf Strukturbaum (DE-588)4183789-7 gnd rswk-swf Intervallgraph (DE-588)4162152-9 s Bipartiter Graph (DE-588)4145661-0 s Strukturbaum (DE-588)4183789-7 s 1\p DE-604 Trenk, Ann N. Sonstige oth 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
spellingShingle | Golumbic, Martin Charles Tolerance graphs Includes bibliographical references (p. 253-259) and indexes Introduction -- Early work on tolerance graphs -- Trees, cotrees and bipartite graphs -- Interval probe graphs -- Bitolerance graphs and ordered sets -- Unit and 50% tolerance graphs -- Comparability and invariance results -- Bounded bitolerance recognition -- Algorithms on tolerance graphs -- The hierarchy of bitolerance orders -- Tolerance models on trees -- Phi-tolerance models -- Directed tolerance graphs -- Open questions and further directions Graph theory Combinatorial analysis Bipartiter Graph (DE-588)4145661-0 gnd Intervallgraph (DE-588)4162152-9 gnd Strukturbaum (DE-588)4183789-7 gnd |
subject_GND | (DE-588)4145661-0 (DE-588)4162152-9 (DE-588)4183789-7 |
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 Combinatorial analysis Bipartiter Graph (DE-588)4145661-0 gnd Intervallgraph (DE-588)4162152-9 gnd Strukturbaum (DE-588)4183789-7 gnd |
topic_facet | Graph theory Combinatorial analysis Bipartiter Graph Intervallgraph Strukturbaum |
work_keys_str_mv | AT golumbicmartincharles tolerancegraphs AT trenkannn tolerancegraphs |