Sparsity Graphs, Structures, and Algorithms /

• Κύριοι συγγραφείς: Nešetřil, Jaroslav (Συγγραφέας), Ossona de Mendez, Patrice (Συγγραφέας)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2012.
• Σειρά: Algorithms and Combinatorics, 28
• Θέματα: Mathematics.; Algorithms.; Computer science > Mathematics.; Convex geometry.; Discrete geometry.; Mathematical logic.; Combinatorics.; Discrete Mathematics in Computer Science.; Convex and Discrete Geometry.; Mathematical Logic and Foundations.; Algorithm Analysis and Problem Complexity.

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

Πίνακας περιεχομένων:

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