Topics in algorithmic graph theory:
Algorithmic graph theory has been expanding at an extremely rapid rate since the middle of the twentieth century, in parallel with the growth of computer science and the accompanying utilization of computers, where efficient algorithms have been a prime goal. This book presents material on developme...
Gespeichert in:
Weitere Verfasser: | , , |
---|---|
Format: | Elektronisch E-Book |
Sprache: | English |
Veröffentlicht: |
Cambridge
Cambridge University Press
2021
|
Schriftenreihe: | Encyclopedia of mathematics and its applications
178 |
Schlagworte: | |
Online-Zugang: | BSB01 FHN01 TUM01 UBG01 URL des Erstveröffentlichers |
Zusammenfassung: | Algorithmic graph theory has been expanding at an extremely rapid rate since the middle of the twentieth century, in parallel with the growth of computer science and the accompanying utilization of computers, where efficient algorithms have been a prime goal. This book presents material on developments on graph algorithms and related concepts that will be of value to both mathematicians and computer scientists, at a level suitable for graduate students, researchers and instructors. The fifteen expository chapters, written by acknowledged international experts on their subjects, focus on the application of algorithms to solve particular problems. All chapters were carefully edited to enhance readability and standardize the chapter structure as well as the terminology and notation. The editors provide basic background material in graph theory, and a chapter written by the book's Academic Consultant, Martin Charles Golumbic (University of Haifa, Israel), provides background material on algorithms as connected with graph theory |
Beschreibung: | 1 Online-Ressource (xvi, 349 Seiten) Diagramme |
ISBN: | 9781108592376 |
DOI: | 10.1017/9781108592376 |
Internformat
MARC
LEADER | 00000nmm a2200000zcb4500 | ||
---|---|---|---|
001 | BV047342708 | ||
003 | DE-604 | ||
005 | 20240416 | ||
007 | cr|uuu---uuuuu | ||
008 | 210624s2021 |||| o||u| ||||||eng d | ||
020 | |a 9781108592376 |c Online |9 978-1-108-59237-6 | ||
024 | 7 | |a 10.1017/9781108592376 |2 doi | |
035 | |a (ZDB-20-CBO)CR9781108592376 | ||
035 | |a (OCoLC)1257817696 | ||
035 | |a (DE-599)BVBBV047342708 | ||
040 | |a DE-604 |b ger |e rda | ||
041 | 0 | |a eng | |
049 | |a DE-12 |a DE-92 |a DE-91 |a DE-473 | ||
082 | 0 | |a 511/.5 | |
084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
100 | 1 | |a Beineke, Lowell W. |0 (DE-588)142229997 |4 edt | |
245 | 1 | 0 | |a Topics in algorithmic graph theory |c edited by Lowell W. Beineke (Purdue University, Indiana), Martin Charles Golumbic (University of Haifa, Israel), Robin J. Wilson (The Open University and University of Oxford) |
264 | 1 | |a Cambridge |b Cambridge University Press |c 2021 | |
300 | |a 1 Online-Ressource (xvi, 349 Seiten) |b Diagramme | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
490 | 1 | |a Encyclopedia of mathematics and its applications |v 178 | |
520 | |a Algorithmic graph theory has been expanding at an extremely rapid rate since the middle of the twentieth century, in parallel with the growth of computer science and the accompanying utilization of computers, where efficient algorithms have been a prime goal. This book presents material on developments on graph algorithms and related concepts that will be of value to both mathematicians and computer scientists, at a level suitable for graduate students, researchers and instructors. The fifteen expository chapters, written by acknowledged international experts on their subjects, focus on the application of algorithms to solve particular problems. All chapters were carefully edited to enhance readability and standardize the chapter structure as well as the terminology and notation. The editors provide basic background material in graph theory, and a chapter written by the book's Academic Consultant, Martin Charles Golumbic (University of Haifa, Israel), provides background material on algorithms as connected with graph theory | ||
650 | 4 | |a Graph algorithms | |
650 | 4 | |a Graph theory | |
650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
655 | 7 | |0 (DE-588)4143413-4 |a Aufsatzsammlung |2 gnd-content | |
689 | 0 | 0 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
689 | 0 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 0 | |5 DE-604 | |
700 | 1 | |a Golumbic, Martin Charles |d 1948- |0 (DE-588)1089493622 |4 edt | |
700 | 1 | |a Wilson, Robin J. |d 1943- |0 (DE-588)141760176 |4 edt | |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 978-1-108-49260-7 |
830 | 0 | |a Encyclopedia of mathematics and its applications |v 178 |w (DE-604)BV044777929 |9 178 | |
856 | 4 | 0 | |u https://doi.org/10.1017/9781108592376 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
912 | |a ZDB-20-CBO | ||
999 | |a oai:aleph.bib-bvb.de:BVB01-032745076 | ||
966 | e | |u https://doi.org/10.1017/9781108592376 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1017/9781108592376 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1017/9781108592376 |l TUM01 |p ZDB-20-CBO |q TUM_Paketkauf_2021 |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1017/9781108592376 |l UBG01 |p ZDB-20-CBO |q UBG_Einzelkauf |x Verlag |3 Volltext |
Datensatz im Suchindex
_version_ | 1804182560395231232 |
---|---|
adam_txt | |
any_adam_object | |
any_adam_object_boolean | |
author2 | Beineke, Lowell W. Golumbic, Martin Charles 1948- Wilson, Robin J. 1943- |
author2_role | edt edt edt |
author2_variant | l w b lw lwb m c g mc mcg r j w rj rjw |
author_GND | (DE-588)142229997 (DE-588)1089493622 (DE-588)141760176 |
author_facet | Beineke, Lowell W. Golumbic, Martin Charles 1948- Wilson, Robin J. 1943- |
building | Verbundindex |
bvnumber | BV047342708 |
classification_rvk | SK 890 |
collection | ZDB-20-CBO |
ctrlnum | (ZDB-20-CBO)CR9781108592376 (OCoLC)1257817696 (DE-599)BVBBV047342708 |
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 15 |
dewey-tens | 510 - Mathematics |
discipline | Mathematik |
discipline_str_mv | Mathematik |
doi_str_mv | 10.1017/9781108592376 |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03478nmm a2200541zcb4500</leader><controlfield tag="001">BV047342708</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20240416 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">210624s2021 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781108592376</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-108-59237-6</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/9781108592376</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9781108592376</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1257817696</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV047342708</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-91</subfield><subfield code="a">DE-473</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.5</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">Beineke, Lowell W.</subfield><subfield code="0">(DE-588)142229997</subfield><subfield code="4">edt</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Topics in algorithmic graph theory</subfield><subfield code="c">edited by Lowell W. Beineke (Purdue University, Indiana), Martin Charles Golumbic (University of Haifa, Israel), Robin J. Wilson (The Open University and University of Oxford)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2021</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xvi, 349 Seiten)</subfield><subfield code="b">Diagramme</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="1" ind2=" "><subfield code="a">Encyclopedia of mathematics and its applications</subfield><subfield code="v">178</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Algorithmic graph theory has been expanding at an extremely rapid rate since the middle of the twentieth century, in parallel with the growth of computer science and the accompanying utilization of computers, where efficient algorithms have been a prime goal. This book presents material on developments on graph algorithms and related concepts that will be of value to both mathematicians and computer scientists, at a level suitable for graduate students, researchers and instructors. The fifteen expository chapters, written by acknowledged international experts on their subjects, focus on the application of algorithms to solve particular problems. All chapters were carefully edited to enhance readability and standardize the chapter structure as well as the terminology and notation. The editors provide basic background material in graph theory, and a chapter written by the book's Academic Consultant, Martin Charles Golumbic (University of Haifa, Israel), provides background material on algorithms as connected with graph theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph algorithms</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">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4143413-4</subfield><subfield code="a">Aufsatzsammlung</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</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">Golumbic, Martin Charles</subfield><subfield code="d">1948-</subfield><subfield code="0">(DE-588)1089493622</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wilson, Robin J.</subfield><subfield code="d">1943-</subfield><subfield code="0">(DE-588)141760176</subfield><subfield code="4">edt</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-1-108-49260-7</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Encyclopedia of mathematics and its applications</subfield><subfield code="v">178</subfield><subfield code="w">(DE-604)BV044777929</subfield><subfield code="9">178</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/9781108592376</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-032745076</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/9781108592376</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/9781108592376</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/9781108592376</subfield><subfield code="l">TUM01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">TUM_Paketkauf_2021</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/9781108592376</subfield><subfield code="l">UBG01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">UBG_Einzelkauf</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
genre | (DE-588)4143413-4 Aufsatzsammlung gnd-content |
genre_facet | Aufsatzsammlung |
id | DE-604.BV047342708 |
illustrated | Not Illustrated |
index_date | 2024-07-03T17:34:50Z |
indexdate | 2024-07-10T09:09:29Z |
institution | BVB |
isbn | 9781108592376 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032745076 |
oclc_num | 1257817696 |
open_access_boolean | |
owner | DE-12 DE-92 DE-91 DE-BY-TUM DE-473 DE-BY-UBG |
owner_facet | DE-12 DE-92 DE-91 DE-BY-TUM DE-473 DE-BY-UBG |
physical | 1 Online-Ressource (xvi, 349 Seiten) Diagramme |
psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO ZDB-20-CBO TUM_Paketkauf_2021 ZDB-20-CBO UBG_Einzelkauf |
publishDate | 2021 |
publishDateSearch | 2021 |
publishDateSort | 2021 |
publisher | Cambridge University Press |
record_format | marc |
series | Encyclopedia of mathematics and its applications |
series2 | Encyclopedia of mathematics and its applications |
spelling | Beineke, Lowell W. (DE-588)142229997 edt Topics in algorithmic graph theory edited by Lowell W. Beineke (Purdue University, Indiana), Martin Charles Golumbic (University of Haifa, Israel), Robin J. Wilson (The Open University and University of Oxford) Cambridge Cambridge University Press 2021 1 Online-Ressource (xvi, 349 Seiten) Diagramme txt rdacontent c rdamedia cr rdacarrier Encyclopedia of mathematics and its applications 178 Algorithmic graph theory has been expanding at an extremely rapid rate since the middle of the twentieth century, in parallel with the growth of computer science and the accompanying utilization of computers, where efficient algorithms have been a prime goal. This book presents material on developments on graph algorithms and related concepts that will be of value to both mathematicians and computer scientists, at a level suitable for graduate students, researchers and instructors. The fifteen expository chapters, written by acknowledged international experts on their subjects, focus on the application of algorithms to solve particular problems. All chapters were carefully edited to enhance readability and standardize the chapter structure as well as the terminology and notation. The editors provide basic background material in graph theory, and a chapter written by the book's Academic Consultant, Martin Charles Golumbic (University of Haifa, Israel), provides background material on algorithms as connected with graph theory Graph algorithms Graph theory Graphentheorie (DE-588)4113782-6 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf (DE-588)4143413-4 Aufsatzsammlung gnd-content Graphentheorie (DE-588)4113782-6 s Algorithmus (DE-588)4001183-5 s DE-604 Golumbic, Martin Charles 1948- (DE-588)1089493622 edt Wilson, Robin J. 1943- (DE-588)141760176 edt Erscheint auch als Druck-Ausgabe 978-1-108-49260-7 Encyclopedia of mathematics and its applications 178 (DE-604)BV044777929 178 https://doi.org/10.1017/9781108592376 Verlag URL des Erstveröffentlichers Volltext |
spellingShingle | Topics in algorithmic graph theory Encyclopedia of mathematics and its applications Graph algorithms Graph theory Graphentheorie (DE-588)4113782-6 gnd Algorithmus (DE-588)4001183-5 gnd |
subject_GND | (DE-588)4113782-6 (DE-588)4001183-5 (DE-588)4143413-4 |
title | Topics in algorithmic graph theory |
title_auth | Topics in algorithmic graph theory |
title_exact_search | Topics in algorithmic graph theory |
title_exact_search_txtP | Topics in algorithmic graph theory |
title_full | Topics in algorithmic graph theory edited by Lowell W. Beineke (Purdue University, Indiana), Martin Charles Golumbic (University of Haifa, Israel), Robin J. Wilson (The Open University and University of Oxford) |
title_fullStr | Topics in algorithmic graph theory edited by Lowell W. Beineke (Purdue University, Indiana), Martin Charles Golumbic (University of Haifa, Israel), Robin J. Wilson (The Open University and University of Oxford) |
title_full_unstemmed | Topics in algorithmic graph theory edited by Lowell W. Beineke (Purdue University, Indiana), Martin Charles Golumbic (University of Haifa, Israel), Robin J. Wilson (The Open University and University of Oxford) |
title_short | Topics in algorithmic graph theory |
title_sort | topics in algorithmic graph theory |
topic | Graph algorithms Graph theory Graphentheorie (DE-588)4113782-6 gnd Algorithmus (DE-588)4001183-5 gnd |
topic_facet | Graph algorithms Graph theory Graphentheorie Algorithmus Aufsatzsammlung |
url | https://doi.org/10.1017/9781108592376 |
volume_link | (DE-604)BV044777929 |
work_keys_str_mv | AT beinekelowellw topicsinalgorithmicgraphtheory AT golumbicmartincharles topicsinalgorithmicgraphtheory AT wilsonrobinj topicsinalgorithmicgraphtheory |