Sparsity : graphs, structures, and algorithms / Jaroslav Nešetřil, Patrice Ossona de Mendez.
Material type:
TextSeries: Algorithms and combinatorics ; 28.Publication details: Heidelberg ; New York : Springer, ©2012.Description: xxiii, 457 pages : illustrations (some color) ; 24 cmContent type: - text
- unmediated
- volume
- 9783642278747
- 3642278744
- 9783642427763
- 3642427766
- 511.5 N575s
| Item type | Current library | Collection | Call number | Copy number | Status | Date due | Barcode |
|---|---|---|---|---|---|---|---|
Books
|
Castorina Estantes Abertas (Open Shelves) | Livros (Books) | 511.5 N575s 2012 IMPA (Browse shelf(Opens below)) | 1 | Available | 39063000808247 |
Includes bibliographical references (pages 431-450) and index.
Introduction -- A few problems -- Prolegomena -- Measuring sparsity -- Classes and their classification -- Bounded height trees and tree-depth -- Decomposition -- Independence -- First-order CSP, limits, and homomorphism dualities -- Preservation theorems -- Restricted homomorphism dualities -- Counting -- Back to classes -- Classes with bounded expansion -- Some applications -- Property testing, hyperfiniteness, and separators -- Core algorithms -- Algorithmic applications -- Further directions.
"This is the first book devoted to the systematic study of sparse graphs and sparse finite structures"--Back cover.
There are no comments on this title.