Sparsity: Graphs, Structures, and Algorithms (Algorithms and Combinatorics #28) (Paperback)

Sparsity: Graphs, Structures, and Algorithms (Algorithms and Combinatorics #28) By Jaroslav Nesetřil, Patrice Ossona De Mendez Cover Image
$99.99
Out of Stock; Usually Arrives in 7-10 Days

Other Books in Series

This is book number 28 in the Algorithms and Combinatorics series.

Description


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


Product Details
ISBN: 9783642427763
ISBN-10: 3642427766
Publisher: Springer
Publication Date: May 9th, 2014
Pages: 459
Language: English
Series: Algorithms and Combinatorics