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...
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| 格式: | Livre numérique |
| 語言: | Anglais |
| 出版: |
Berlin, Heidelberg :
Springer Berlin Heidelberg
[20..].
Cham : Springer Nature |
| 版: | 1st ed. 2012. |
| 叢編: | Algorithms and Combinatorics
28 |
| 主題: | |
| 在線閱讀: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| 提示: |
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 |
| 總結: | 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 |
|---|---|
| Item Description: | Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| ISBN: | 9783642278754 |
| ISSN: | 2197-6783 |
| 訪問: | Accès en ligne pour les établissements français bénéficiaires des licences nationales Accès soumis à abonnement pour tout autre établissement 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 |