Sparsity Graphs, Structures, and Algorithms / by Jaroslav Nešetřil, Patrice Ossona de Mendez.

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

Saved in:
Bibliographic Details
Main Author: Nešetřil, Jaroslav
Corporate Author: SpringerLink (Online service)
Other Authors: Mendez, Patrice Ossona de
Format: Electronic eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg, 2012.
Series:Algorithms and combinatorics ; 28.
Subjects:
Mathematics.
Computer software.
Computational complexity.
Combinatorial analysis.
Discrete groups.
Logic, Symbolic and mathematical.
Online Access: Full text (Wentworth users only).
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