Sparsity : graphs, structures, and algorithms

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

ver descrição completa

Na minha lista:
Detalhes bibliográficos
Auteurs principaux: Nešetřil, Jaroslav, 1946-...., Mathématicien, Ossona de Mendez, Patrice, 1966- (Auteur), Ossona de Mendez, Patrice (Auteur)
Formato: Livre numérique
Idioma:Anglais
Publicado em: Berlin, Heidelberg : Springer Berlin Heidelberg [20..].
Cham : Springer Nature
Edição:1st ed. 2012.
Colecção:Algorithms and Combinatorics 28
Assuntos:
Acesso em linha:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Nota: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Sparsity, graphs, structures, and algorithms, Jaroslav Nešetřil, Patrice Ossona de Mendez, Berlin, Springer, 2012, 1 volume (xxiii-457 pages), Algorithms and Combinatorics, 978-3-642-27874-7
• Sparsity, graphs, structures, and algorithms, Jaroslav Nešetřil, Patrice Ossona de Mendez, Berlin, Springer, 2012, 1 volume (xxiii-457 pages), Algorithms and Combinatorics, 978-3-642-27874-7
• Sparsity, Texte imprimé, 9783642278761
• Sparsity, Texte imprimé, 9783642427763
LEADER 04972nam a22004337a 4500
001 958181
008 130325q2000 xxe ||| |||| 00| 0 eng d
009 PPN168311135
020 |a 9783642278754 
041 0 |a eng 
082 |a 511.6 
100 1 |a Nešetřil, Jaroslav,  |d 1946-....,  |c Mathématicien. 
245 1 0 |a Sparsity :  |b graphs, structures, and algorithms   |c by Jaroslav Nešetřil, Patrice Ossona de Mendez. 
250 |a 1st ed. 2012. 
260 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg. 
260 |a Cham :  |b Springer Nature,  |c [20..]. 
490 0 |a Algorithms and Combinatorics  |v 28  |x 2197-6783 
500 |a Archives Springer e-books (Licence nationale) 
500 |a Archives Springer e-books (Licence nationale) 
505 1 |a 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 
505 0 |a Part I Presentation -- Part II. The Theory -- Part III Applications -- 1. Introduction -- 2. A Few Problems -- 3. Commented Contents -- 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 -- 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 
506 |a Accès en ligne pour les établissements français bénéficiaires des licences nationales 
506 |a Accès soumis à abonnement pour tout autre établissement 
506 |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 
520 |a 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 
650 |a Analyse combinatoire 
650 |a Matrices éparses 
650 |a Complexité de calcul (informatique) 
700 1 |a Ossona de Mendez, Patrice,  |d 1966-  |4 aut 
700 1 |a Ossona de Mendez, Patrice.  |4 aut 
776 0 |0 159091365  |t Sparsity  |o graphs, structures, and algorithms  |f Jaroslav Nešetřil, Patrice Ossona de Mendez  |c Berlin  |n Springer  |d 2012  |p 1 volume (xxiii-457 pages)  |s Algorithms and Combinatorics  |z 978-3-642-27874-7 
776 0 |0 159091365  |t Sparsity  |o graphs, structures, and algorithms  |f Jaroslav Nešetřil, Patrice Ossona de Mendez  |c Berlin  |n Springer  |d 2012  |p 1 volume (xxiii-457 pages)  |s Algorithms and Combinatorics  |z 978-3-642-27874-7 
776 0 |t Sparsity  |b Texte imprimé  |z 9783642278761 
776 0 |t Sparsity  |b Texte imprimé  |z 9783642427763 
856 4 |q PDF  |u https://doi.org/10.1007/978-3-642-27875-4  |z Accès sur la plateforme de l'éditeur 
856 4 |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-N479XRB2-5  |z Accès sur la plateforme Istex 
856 4 |5 452349901:749567996  |u https://ezproxy.univ-orleans.fr/login?url=https://dx.doi.org/10.1007/978-3-642-27875-4  |z Accès Université d'Orléans 
856 4 |5 180339901:752316923  |u https://ezproxy.insa-cvl.fr/login?qurl=https://dx.doi.org/10.1007/978-3-642-27875-4  |z Accès INSA CVL 
997 |0 958181  |1 Livre numérique  |a Ressource numérique  |b INSA  |b ENSA  |c 0/Bibliothèque numérique/  |c 1/Bibliothèque numérique/Autre ressource numérique/