Sparsity: Graphs, Structures, and Algorithms - Algorithms and Combinatorics 28 (Hardback)
  • Sparsity: Graphs, Structures, and Algorithms - Algorithms and Combinatorics 28 (Hardback)
zoom

Sparsity: Graphs, Structures, and Algorithms - Algorithms and Combinatorics 28 (Hardback)

(author), (author)
£54.99
Hardback 459 Pages / Published: 25/04/2012
  • We can order this

Usually despatched within 3 weeks

  • This item has been added to your basket

This is the first book devoted to the systematic study of sparse graphs and sparse finite structures. Although the notion of sparsity appears in various contexts and is a typical example of a hard to define notion, the authors devised an unifying classification of general classes of structures. This approach is very robust and it has many remarkable properties. For example the classification is expressible in many different ways involving most extremal combinatorial invariants.

This study of sparse structures found applications in such diverse areas as algorithmic graph theory, complexity of algorithms, property testing, descriptive complexity and mathematical logic (homomorphism preservation,fixed parameter tractability and constraint satisfaction problems). It should be stressed that despite of its generality this approach leads to linear (and nearly linear) algorithms.

Jaroslav Nesetril is a professor at Charles University, Prague; Patrice Ossona de Mendez is a CNRS researcher et EHESS, Paris.

This book is related to the material presented by the first author at ICM 2010.

Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN: 9783642278747
Number of pages: 459
Weight: 884 g
Dimensions: 235 x 155 x 30 mm
Edition: 2012 ed.


MEDIA REVIEWS

From the reviews:

"This well-crafted and well-written work ... brings the authors' vast knowledge, expertise, taste, and judgment to bear on an increasingly important and mainstream subject. ... This is a much-needed book devoted to the systematic study of sparse graphs and sparse classes of structures. ... This is an important and useful book. It contains a wealth of up-to-date material, some of which is not readily available in research papers. ... A researcher in graph theory or related fields will find this an excellent reference work." (Jozsef Balogh, Mathematical Reviews, March, 2013)

"This is an excellent and useful book for all researchers in mathematics, computer science, logic, and even in any field in physical science, who seek the tools available for analysis of the properties of discrete structures, and particularly, sparse structures." (Tadashi Sakuma, zbMATH, Vol. 1268, 2013)

"The book is very well written and diagrammed to beautifully present the theory supporting the study of sparse and dense objects. ... the book contains up-to-date research topics laid out in an amazing chain of thoughts. Almost every chapter ends with exercises, aiding professors in advanced graduate courses. The extensive list of references, together with conjectures and open problems, offers professors, students, and researchers ... profound knowledge on the sparsity of graphs, all in one great book." (Andre Maximo, Computing Reviews, October, 2012)

You may also be interested in...

Discrete Mathematics
Added to basket
Problems in Probability
Added to basket
Catalan Numbers
Added to basket
A Combinatorial Introduction to Topology
Added to basket
Combinatorial Optimization
Added to basket
Introduction to Graph Theory
Added to basket

Reviews

Please sign in to write a review

Your review has been submitted successfully.