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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Beineke, Lowell W.
Weitere Verfasser: Golumbic, Martin Charles, Wilson, Robin J.
Format: E-Book
Sprache:English
Veröffentlicht: Cambridge Cambridge University Press 2021
Schriftenreihe:Encyclopedia of mathematics and its applications 178
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!

MARC

LEADER 00000nam a2200000 i 4500
001 ZDB-20-CTM-CR9781108592376
003 UkCbUP
005 20210526074757.0
006 m|||||o||d||||||||
007 cr||||||||||||
008 180725s2021||||enk o ||1 0|eng|d
020 |a 9781108592376 
100 1 |a Beineke, Lowell W. 
245 1 0 |a Topics in algorithmic graph theory  |c Lowell W. Beineke, Martin Charles Golumbic, Robin J. Wilson 
264 1 |a Cambridge  |b Cambridge University Press  |c 2021 
300 |a 1 Online-Ressource (xvi, 349 Seiten) 
336 |b txt 
337 |b c 
338 |b cr 
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. 
700 1 |a Golumbic, Martin Charles 
700 1 |a Wilson, Robin J. 
776 0 8 |i Erscheint auch als  |n Druck-Ausgabe  |z 9781108492607 
856 4 0 |l TUM01  |p ZDB-20-CTM  |q TUM_PDA_CTM  |u https://doi.org/10.1017/9781108592376  |3 Volltext 
912 |a ZDB-20-CTM 
912 |a ZDB-20-CTM 
049 |a DE-91 

Datensatz im Suchindex

DE-BY-TUM_katkey ZDB-20-CTM-CR9781108592376
_version_ 1818779679838961664
adam_text
any_adam_object
author Beineke, Lowell W.
author2 Golumbic, Martin Charles
Wilson, Robin J.
author2_role

author2_variant m c g mc mcg
r j w rj rjw
author_facet Beineke, Lowell W.
Golumbic, Martin Charles
Wilson, Robin J.
author_role
author_sort Beineke, Lowell W.
author_variant l w b lw lwb
building Verbundindex
bvnumber localTUM
collection ZDB-20-CTM
doi_str_mv 10.1017/9781108592376
format eBook
fullrecord <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01907nam a2200277 i 4500</leader><controlfield tag="001">ZDB-20-CTM-CR9781108592376</controlfield><controlfield tag="003">UkCbUP</controlfield><controlfield tag="005">20210526074757.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr||||||||||||</controlfield><controlfield tag="008">180725s2021||||enk o ||1 0|eng|d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781108592376</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Beineke, Lowell W.</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Topics in algorithmic graph theory</subfield><subfield code="c">Lowell W. Beineke, Martin Charles Golumbic, Robin J. Wilson</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></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</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="700" ind1="1" ind2=" "><subfield code="a">Golumbic, Martin Charles</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wilson, Robin J.</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">9781108492607</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">TUM01</subfield><subfield code="p">ZDB-20-CTM</subfield><subfield code="q">TUM_PDA_CTM</subfield><subfield code="u">https://doi.org/10.1017/9781108592376</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield></record></collection>
id ZDB-20-CTM-CR9781108592376
illustrated Not Illustrated
indexdate 2024-12-18T12:04:27Z
institution BVB
isbn 9781108592376
language English
open_access_boolean
owner DE-91
DE-BY-TUM
owner_facet DE-91
DE-BY-TUM
physical 1 Online-Ressource (xvi, 349 Seiten)
psigel ZDB-20-CTM
publishDate 2021
publishDateSearch 2021
publishDateSort 2021
publisher Cambridge University Press
record_format marc
series2 Encyclopedia of mathematics and its applications
spelling Beineke, Lowell W.
Topics in algorithmic graph theory Lowell W. Beineke, Martin Charles Golumbic, Robin J. Wilson
Cambridge Cambridge University Press 2021
1 Online-Ressource (xvi, 349 Seiten)
txt
c
cr
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.
Golumbic, Martin Charles
Wilson, Robin J.
Erscheint auch als Druck-Ausgabe 9781108492607
TUM01 ZDB-20-CTM TUM_PDA_CTM https://doi.org/10.1017/9781108592376 Volltext
spellingShingle Beineke, Lowell W.
Topics in algorithmic graph theory
title Topics in algorithmic graph theory
title_auth Topics in algorithmic graph theory
title_exact_search Topics in algorithmic graph theory
title_full Topics in algorithmic graph theory Lowell W. Beineke, Martin Charles Golumbic, Robin J. Wilson
title_fullStr Topics in algorithmic graph theory Lowell W. Beineke, Martin Charles Golumbic, Robin J. Wilson
title_full_unstemmed Topics in algorithmic graph theory Lowell W. Beineke, Martin Charles Golumbic, Robin J. Wilson
title_short Topics in algorithmic graph theory
title_sort topics in algorithmic graph theory
url https://doi.org/10.1017/9781108592376
work_keys_str_mv AT beinekelowellw topicsinalgorithmicgraphtheory
AT golumbicmartincharles topicsinalgorithmicgraphtheory
AT wilsonrobinj topicsinalgorithmicgraphtheory