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

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autores principales: Nešetřil, Jaroslav (Autor), Ossona de Mendez, Patrice (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2012.
Edición:1st ed. 2012.
Colección:Algorithms and Combinatorics, 28
Temas:
Discrete mathematics.
Computer science-Mathematics.
Convex geometry .
Discrete geometry.
Mathematical logic.
Algorithms.
Discrete Mathematics.
Discrete Mathematics in Computer Science.
Convex and Discrete Geometry.
Mathematical Logic and Foundations.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • 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 .

Ejemplares similares