Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Wegen Wartungsarbeiten steht das KOBV-Portal am 11.03.2025 ggf. nur eingeschränkt zur Verfügung. Wir bitten um Ihr Verständnis.
Export
Filter
  • 1
    Online Resource
    Online Resource
    Cambridge :Cambridge University Press,
    UID:
    almafu_9960118517602883
    Format: 1 online resource (xvi, 349 pages) : , digital, PDF file(s).
    ISBN: 1-108-67107-1 , 1-108-75172-5 , 1-108-59237-6
    Series Statement: Encyclopedia of mathematics and its applications ; 178
    Content: 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.
    Note: Title from publisher's bibliographic system (viewed on 17 May 2021). , Preliminaries / Lowell W. Beineke, Martin Charles Golumbic and Robin J. EWilson -- Graph and algorithms / Martin Charles Golumbic -- Graph colouring varieations / Alain Hertz and Bernard Ries -- Total colouring / Celina M.H. De Figueiredo -- Testing of graph properties / Ilan Newman -- Cliques, colouring and satisfiability : from structure to algorithms / Vadim Lozin -- Chordal graphs / Martin Charles Golumbic -- Dually and strongly chordal graphs / Andreas Brandstädt and Martin Charles Golumbic -- Leaf powers / Christian Rosenke, Van Bang Le and Andreas Brandstädt -- Split graphs / Karen L. Collins and Ann N. Trenk -- Strong cliques and stable sets / Martin Milanič -- Restricted matchings / Maximilian Fürst and Dieter Rautenbach -- Covering geometric domains / Gila Morgenstern -- Graph homomorphisms / Pavol Hell and Jaroslav Nešetřil -- Sparsity and model theory / Patrice Ossona de Mendez -- Extremal vertex-sets / Serge Gaspers.
    Additional Edition: ISBN 1-108-49260-6
    Language: English
    Subjects: Mathematics
    RVK:
    Keywords: Aufsatzsammlung
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Book
    Book
    Cambridge, United Kingdom ; New York, NY, USA ; Port Melbourne, Australia ; New Delhi, India ; Singapore :Cambridge University Press,
    UID:
    almahu_BV047396989
    Format: xvi, 349 Seiten : , Diagramme.
    ISBN: 978-1-108-49260-7
    Series Statement: Encyclopedia of mathematics and its applications 178
    Additional Edition: Erscheint auch als Online-Ausgabe ISBN 978-1-108-59237-6 10.1017/978-1-108-59237-6
    Language: English
    Subjects: Mathematics
    RVK:
    Keywords: Graphentheorie ; Algorithmus ; Aufsatzsammlung ; Aufsatzsammlung
    Author information: Wilson, Robin J., 1943-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Did you mean 9781108562386?
Did you mean 9781108590372?
Did you mean 9781108492386?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages