Sparsity : Graphs, Structures, and Algorithms (eBook, 2012) [WorldCat.org]
skip to content
Sparsity : Graphs, Structures, and Algorithms
Checking...

Sparsity : Graphs, Structures, and Algorithms

Author: Jaroslav Nešetřil; Patrice Ossona de Mendez
Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2012.
Series: Algorithms and combinatorics, 28.
Edition/Format:   eBook : Document : English : 1st ed. 2012View all editions and formats
Summary:
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 approach is very robust and it has many remarkable properties. For example the classification is expressible in many  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Material Type: Document
Document Type: Book, Computer File
All Authors / Contributors: Jaroslav Nešetřil; Patrice Ossona de Mendez
ISBN: 3642278752 9783642278754 9783642278747 3642278744
OCLC Number: 1126447036
Language Note: English.
Notes: Description based upon print version of record.
Description: 1 online resource (469 p.)
Contents: 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 .
Series Title: Algorithms and combinatorics, 28.
Responsibility: by Jaroslav Nešetřil, Patrice Ossona de Mendez.

Abstract:

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 approach is very robust and it has many remarkable properties. For example the classification is expressible in many different ways involving most extremal combinatorial invariants. This study of sparse structures found applications in such diverse areas as algorithmic graph theory, complexity of algorithms, property testing, descriptive complexity and mathematical logic (homomorphism preservation,fixed parameter tractability and constraint satisfaction problems). It should be stressed that despite of its generality this approach leads to linear (and nearly linear) algorithms. Jaroslav Nešetřil is a professor at Charles University, Prague; Patrice Ossona de Mendez is a CNRS researcher et EHESS, Paris. This book is related to the material presented by the first author at ICM 2010.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.