Overview
- One of the first textbooks on the topic of sparsity - a core area of current discrete mathematics
- Extremely useful to both mathematicians and computer scientists
- Pedagogically excellent
Part of the book series: Algorithms and Combinatorics (AC, volume 28)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (20 chapters)
-
Front Matter
-
Presentation
-
Front Matter
-
-
The Theory
-
Front Matter
-
-
Applications
-
Front Matter
-
Keywords
About this book
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 Nešetřil 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.
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.” (József 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)Authors and Affiliations
Bibliographic Information
Book Title: Sparsity
Book Subtitle: Graphs, Structures, and Algorithms
Authors: Jaroslav Nešetřil, Patrice Ossona de Mendez
Series Title: Algorithms and Combinatorics
DOI: https://doi.org/10.1007/978-3-642-27875-4
Publisher: Springer Berlin, Heidelberg
eBook Packages: Mathematics and Statistics, Mathematics and Statistics (R0)
Copyright Information: Springer-Verlag Berlin Heidelberg 2012
Hardcover ISBN: 978-3-642-27874-7Published: 25 April 2012
Softcover ISBN: 978-3-642-42776-3Published: 09 May 2014
eBook ISBN: 978-3-642-27875-4Published: 24 April 2012
Series ISSN: 0937-5511
Series E-ISSN: 2197-6783
Edition Number: 1
Number of Pages: XXIII, 459
Number of Illustrations: 32 b/w illustrations, 100 illustrations in colour
Topics: Combinatorics, Discrete Mathematics in Computer Science, Convex and Discrete Geometry, Mathematical Logic and Foundations, Algorithm Analysis and Problem Complexity