E-Book, Englisch, Band 28, 457 Seiten, eBook
Reihe: Algorithms and Combinatorics
Nešetril / Nesetril / Ossona de Mendez Sparsity
1. Auflage 2012
ISBN: 978-3-642-27875-4
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark
Graphs, Structures, and Algorithms
E-Book, Englisch, Band 28, 457 Seiten, eBook
Reihe: Algorithms and Combinatorics
ISBN: 978-3-642-27875-4
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark
Zielgruppe
Graduate
Autoren/Hrsg.
Weitere Infos & Material
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.