Sparsity (Graphs, Structures, and Algorithms)

Jaroslav Nesetril (1) , Patrice Ossona de Mendez (2)

1 IUUK - Computer Science Institute of Charles University [Prague]
2 CAMS - Centre d'Analyse et de Mathématique sociales

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 fuzzy 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. This book is related to the material presented by the first author at ECM 1998 and ICM 2010.

Domaines: Combinatoire [math.CO]

Jaroslav Nesetril, Patrice Ossona de Mendez. Sparsity (Graphs, Structures, and Algorithms). Springer, pp.457, 2012, Algorithms and Combinatorics, 978-3-642-27874-7. ⟨hal-00768681⟩