|
|
|
|
LEADER |
05307cam a22008532 4500 |
001 |
183-883365995 |
003 |
DE-627 |
005 |
20240202215200.0 |
007 |
cr uuu---uuuuu |
008 |
181105s2004 xxk|||||o 00| ||eng c |
020 |
|
|
|c ebook
|
020 |
|
|
|a 9780521827584
|c hardback
|9 978-0-521-82758-4
|
020 |
|
|
|c hardback
|
020 |
|
|
|a 9780511542985
|c : ebook
|9 978-0-511-54298-5
|
024 |
7 |
|
|a 10.1017/CBO9780511542985
|2 doi
|
035 |
|
|
|a (DE-627)883365995
|
035 |
|
|
|a (DE-576)512557713
|
035 |
|
|
|a (DE-599)GBV883365995
|
035 |
|
|
|a (OCoLC)850253412
|
035 |
|
|
|a (OCoLC)850253412
|
035 |
|
|
|a (ZBM)1091.05001
|
035 |
|
|
|a (ZBM)1091.05001
|
035 |
|
|
|a (EBP)027186989
|
035 |
|
|
|a (CUP)CR9780511542985
|
040 |
|
|
|a DE-627
|b eng
|c DE-627
|e rda
|
041 |
|
|
|a eng
|
044 |
|
|
|c XA-GB
|
050 |
|
0 |
|a QA166
|
084 |
|
|
|a SK 890
|2 rvk
|0 (DE-625)rvk/143267:
|
084 |
|
|
|a *05-02
|2 msc
|
084 |
|
|
|a 05Cxx
|2 msc
|
084 |
|
|
|a 31.12
|2 bkl
|
084 |
|
|
|a 54.51
|2 bkl
|
100 |
1 |
|
|a Golumbic, Martin Charles
|d 1948-
|e VerfasserIn
|0 (DE-588)1089493622
|0 (DE-627)853297878
|0 (DE-576)459550837
|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 pages)
|
336 |
|
|
|a Text
|b txt
|2 rdacontent
|
337 |
|
|
|a Computermedien
|b c
|2 rdamedia
|
338 |
|
|
|a Online-Ressource
|b cr
|2 rdacarrier
|
490 |
1 |
|
|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 |
|
0 |
|a Graph theory
|
650 |
|
4 |
|a Graph theory
|
689 |
0 |
0 |
|D s
|0 (DE-588)4162152-9
|0 (DE-627)105464635
|0 (DE-576)209871431
|a Intervallgraph
|2 gnd
|
689 |
0 |
1 |
|D s
|0 (DE-588)4113782-6
|0 (DE-627)105826898
|0 (DE-576)209479302
|a Graphentheorie
|2 gnd
|
689 |
0 |
|
|5 (DE-627)
|
700 |
1 |
|
|a Trenk, Ann N.
|e VerfasserIn
|0 (DE-588)112756398X
|0 (DE-627)881980005
|0 (DE-576)485255065
|4 aut
|
776 |
1 |
|
|z 9780521827584
|c : hardback
|
776 |
0 |
8 |
|a Golumbic, Martin Charles, 1948 -
|t Tolerance graphs
|d Cambridge [u.a.] : Cambridge Univ. Press, 2004
|h XII, 265 S.
|w (DE-627)368936244
|w (DE-576)110555155
|z 0521827582
|
776 |
0 |
8 |
|i Print version
|z 9780521827584
|
830 |
|
0 |
|a Cambridge studies in advanced mathematics
|v 89
|9 89
|w (DE-627)883740494
|w (DE-576)485930307
|w (DE-600)2890193-9
|7 ns
|
856 |
4 |
0 |
|u https://doi.org/10.1017/CBO9780511542985
|m X:CUP
|x Verlag
|3 Volltext
|
856 |
4 |
2 |
|u https://zbmath.org/?q=an:1091.05001
|m B:ZBM
|v 2021-04-12
|x Verlag
|y Zentralblatt MATH
|3 Inhaltstext
|
912 |
|
|
|a ZDB-20-CTM
|
912 |
|
|
|a BSZ-20-CBO-FR003C
|
912 |
|
|
|a ZDB-20-CBO
|
912 |
|
|
|a SSG-OPC-mat
|
924 |
1 |
|
|a 1838360301
|b DE-46
|9 46
|c GBV
|d d
|k https://doi.org/10.1017/CBO9780511542985
|
924 |
1 |
|
|a 1676533095
|b DE-28
|9 28
|c GBV
|d d
|k https://doi.org/10.1017/CBO9780511542985
|
924 |
1 |
|
|a 3843024790
|b DE-3
|9 3
|c GBV
|d d
|k https://doi.org/10.1017/CBO9780511542985
|
924 |
1 |
|
|a 4375061820
|b DE-Ma9
|9 Ma 9
|c GBV
|d d
|g eBook Cambridge
|k https://doi.org/10.1017/CBO9780511542985
|k http://han.med.uni-magdeburg.de/han/ebooks-cambridge-university-press/doi.org/10.1017/CBO9780511542985
|
924 |
1 |
|
|a 398853465X
|b DE-715
|9 715
|c GBV
|d d
|k http://49gbv-uob-primo.hosted.exlibrisgroup.com/openurl/49GBV_UOB/UOB_services_page?u.ignore_date_coverage=true&rft.mms_id=991015502790303501
|l Cambridge University Press EBS 2023/2024 - Dateneinspielung 1.9.2023-31.08.2024
|
924 |
1 |
|
|a 4375423870
|b DE-517
|9 517
|c GBV
|d d
|k https://doi.org/10.1017/CBO9780511542985
|
924 |
1 |
|
|a 4449384113
|b DE-21
|9 21
|c BSZ
|d b
|e p
|k https://doi.org/10.1017/CBO9780511542985
|l Zugang für die Universität Tübingen
|
924 |
1 |
|
|a 4043274351
|b DE-Ch1
|9 Ch 1
|c BSZ
|d d
|k https://doi.org/10.1017/CBO9780511542985
|
924 |
1 |
|
|a 3392334332
|b DE-Frei3c
|9 Frei 3c
|c BSZ
|d d
|g eBook Cambridge UP
|k https://doi.org/10.1017/CBO9780511542985
|l Click here to access online.
|l For local users only.
|
935 |
|
|
|i Blocktest
|
936 |
r |
v |
|a SK 890
|b Ganzzahlige und kombinatorische Optimierung, Graphentheorie
|k Mathematik
|k Monografien
|k Ganzzahlige und kombinatorische Optimierung, Graphentheorie
|0 (DE-627)1271487969
|0 (DE-625)rvk/143267:
|0 (DE-576)201487969
|
936 |
b |
k |
|a 31.12
|j Kombinatorik
|j Graphentheorie
|q SEPA
|0 (DE-627)106418963
|
936 |
b |
k |
|a 54.51
|j Programmiermethodik
|q SEPA
|0 (DE-627)106418122
|
951 |
|
|
|a BO
|
980 |
|
|
|a 883365995
|b 183
|c sid-183-col-kxpbbi
|
SOLR
_version_ |
1798422284049842176 |
author |
Golumbic, Martin Charles, Trenk, Ann N. |
author_facet |
Golumbic, Martin Charles, Trenk, Ann N. |
author_role |
aut, aut |
author_sort |
Golumbic, Martin Charles 1948- |
author_variant |
m c g mc mcg, a n t an ant |
building |
Library A |
callnumber-first |
Q - Science |
callnumber-label |
QA166 |
callnumber-raw |
QA166 |
callnumber-search |
QA166 |
callnumber-sort |
QA 3166 |
callnumber-subject |
QA - Mathematics |
collection |
ZDB-20-CTM, BSZ-20-CBO-FR003C, ZDB-20-CBO, SSG-OPC-mat, sid-183-col-kxpbbi |
contents |
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. |
ctrlnum |
(DE-627)883365995, (DE-576)512557713, (DE-599)GBV883365995, (OCoLC)850253412, (ZBM)1091.05001, (EBP)027186989, (CUP)CR9780511542985 |
doi_str_mv |
10.1017/CBO9780511542985 |
facet_912a |
ZDB-20-CTM, BSZ-20-CBO-FR003C, ZDB-20-CBO, SSG-OPC-mat |
facet_avail |
Online |
facet_local_del330 |
Intervallgraph, Graphentheorie |
finc_class_facet |
Mathematik |
fincclass_txtF_mv |
science-mathematics, science-computerscience |
footnote |
Title from publisher's bibliographic system (viewed on 05 Oct 2015) |
format |
eBook |
format_access_txtF_mv |
Book, E-Book |
format_de105 |
Ebook |
format_de14 |
Book, E-Book |
format_de15 |
Book, E-Book |
format_del152 |
Buch |
format_detail_txtF_mv |
text-online-monograph-independent |
format_dezi4 |
e-Book |
format_finc |
Book, E-Book |
format_legacy |
ElectronicBook |
format_legacy_nrw |
Book, E-Book |
format_nrw |
Book, E-Book |
format_strict_txtF_mv |
E-Book |
geogr_code |
not assigned |
geogr_code_person |
not assigned |
hierarchy_parent_id |
183-883740494 |
hierarchy_parent_title |
Cambridge studies in advanced mathematics |
hierarchy_sequence |
89 |
hierarchy_top_id |
183-883740494 |
hierarchy_top_title |
Cambridge studies in advanced mathematics |
id |
183-883365995 |
illustrated |
Not Illustrated |
imprint |
Cambridge, Cambridge University Press, 2004 |
imprint_str_mv |
Cambridge: Cambridge University Press, 2004 |
institution |
FID-BBI-DE-23 |
is_hierarchy_id |
183-883365995 |
is_hierarchy_title |
Tolerance graphs |
isbn |
9780521827584, 9780511542985 |
isbn_isn_mv |
9780521827584, 0521827582 |
language |
English |
last_indexed |
2024-05-07T19:12:21.323Z |
marc024a_ct_mv |
10.1017/CBO9780511542985 |
marc_error |
[geogr_code]Unable to make public java.lang.AbstractStringBuilder java.lang.AbstractStringBuilder.append(java.lang.String) accessible: module java.base does not "opens java.lang" to unnamed module @20e8cc55 |
match_str |
golumbic2004tolerancegraphs |
mega_collection |
K10plus Verbundkatalog |
multipart_link |
485930307 |
multipart_part |
(485930307)89 |
oclc_num |
850253412 |
physical |
1 online resource (xii, 265 pages) |
publishDate |
2004 |
publishDateSort |
2004 |
publishPlace |
Cambridge |
publisher |
Cambridge University Press |
record_format |
marcfinc |
record_id |
883365995 |
recordtype |
marcfinc |
rvk_facet |
SK 890 |
rvk_label |
Mathematik, Monografien, Ganzzahlige und kombinatorische Optimierung, Graphentheorie |
rvk_path |
SK 890, SK, SA - SP |
rvk_path_str_mv |
SK 890, SK, SA - SP |
series |
Cambridge studies in advanced mathematics, 89 |
series2 |
Cambridge studies in advanced mathematics ; 89 |
source_id |
183 |
spelling |
Golumbic, Martin Charles 1948- VerfasserIn (DE-588)1089493622 (DE-627)853297878 (DE-576)459550837 aut, Tolerance graphs Martin Charles Golumbic, Ann N. Trenk., Cambridge Cambridge University Press 2004, 1 online resource (xii, 265 pages), Text txt rdacontent, Computermedien c rdamedia, Online-Ressource 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, s (DE-588)4162152-9 (DE-627)105464635 (DE-576)209871431 Intervallgraph gnd, s (DE-588)4113782-6 (DE-627)105826898 (DE-576)209479302 Graphentheorie gnd, (DE-627), Trenk, Ann N. VerfasserIn (DE-588)112756398X (DE-627)881980005 (DE-576)485255065 aut, 9780521827584 : hardback, Golumbic, Martin Charles, 1948 - Tolerance graphs Cambridge [u.a.] : Cambridge Univ. Press, 2004 XII, 265 S. (DE-627)368936244 (DE-576)110555155 0521827582, Print version 9780521827584, Cambridge studies in advanced mathematics 89 89 (DE-627)883740494 (DE-576)485930307 (DE-600)2890193-9 ns, https://doi.org/10.1017/CBO9780511542985 X:CUP Verlag Volltext, https://zbmath.org/?q=an:1091.05001 B:ZBM 2021-04-12 Verlag Zentralblatt MATH Inhaltstext |
spellingShingle |
Golumbic, Martin Charles, Trenk, Ann N., Tolerance graphs, Cambridge studies in advanced mathematics, 89, 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, Graphentheorie |
title |
Tolerance graphs |
title_auth |
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_in_hierarchy |
89. Tolerance graphs (2004) |
title_short |
Tolerance graphs |
title_sort |
tolerance graphs |
title_unstemmed |
Tolerance graphs |
topic |
Graph theory, Intervallgraph, Graphentheorie |
topic_facet |
Graph theory, Intervallgraph, Graphentheorie |
url |
https://doi.org/10.1017/CBO9780511542985, https://zbmath.org/?q=an:1091.05001 |
work_keys_str_mv |
AT golumbicmartincharles tolerancegraphs, AT trenkannn tolerancegraphs |