Cover Image
Read Now

Sparsity Graphs, Structures, and Algorithms

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...

Full description

Bibliographic Details
Main Authors: Nešetřil, Jaroslav, Ossona de Mendez, Patrice (Author)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 2012, 2012
Edition:1st ed. 2012
Series:Algorithms and Combinatorics
Subjects:
Computer Science / Mathematics
Discrete Mathematics In Computer Science
Mathematical Logic
Algorithms
Convex Geometry 
Discrete Mathematics
Convex And Discrete Geometry
Mathematical Logic And Foundations
Discrete Geometry
Online Access:
Collection: Springer eBooks 2005- - Collection details see MPG.ReNa
Table of Contents:
  • Part I Presentation: 1. Introduction
  • 2. A Few Problems
  • 3. Commented Contents
  • Part II. The Theory: 4. Prolegomena
  • 5. Measuring Sparsity
  • 6. Classes and their Classification
  • 7. Bounded Height Trees and Tree-Depth
  • 8. Decomposition
  • 9. Independence
  • 10. First-Order Constraint Satisfaction Problems and Homomorphism Dualities
  • 11. Restricted Homomorphism Dualities
  • 12. Counting
  • 13. Back to Classes
  • Part III Applications: 14. Classes with Bounded Expansion – Examples
  • 15. Property Testing, Hyperfiniteness and Separators
  • 16. Algorithmic Applications
  • 17. Other Applications
  • 18. Conclusion
  • Bibliography
  • Index
  • List of Symbols

Similar Items