• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Sparsity: Graphs, Structures, and Algorithms

Sparsity: Graphs, Structures, and Algorithms

Paperback

Series: Algorithms and Combinatorics, Book 28

General ComputersGeneral MathematicsGeometry

ISBN10: 3642427766
ISBN13: 9783642427763
Publisher: Springer
Published: May 9 2014
Pages: 459
Weight: 1.48
Height: 0.97 Width: 6.14 Depth: 9.21
Language: English
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​.

Also in

General Mathematics