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.
- DOI https://doi.org/10.1007/978-3-642-27875-4
- Copyright Information Springer-Verlag Berlin Heidelberg 2012
- Publisher Name Springer, Berlin, Heidelberg
- eBook Packages Mathematics and Statistics
- Print ISBN 978-3-642-27874-7
- Online ISBN 978-3-642-27875-4
- Series Print ISSN 0937-5511
- Buy this book on publisher's site