
Ebook Info
- Published: 2012
- Number of pages: 482 pages
- Format: PDF
- File Size: 5.05 MB
- Authors: Jaroslav Nešetřil
Description
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.
User’s Reviews
Reviews from Amazon users which were colected at the time this book was published on the website:
⭐Happy with it.
⭐
⭐
⭐
⭐
⭐
Keywords
Free Download Sparsity: Graphs, Structures, and Algorithms (Algorithms and Combinatorics Book 28) 2012th Edition in PDF format
Sparsity: Graphs, Structures, and Algorithms (Algorithms and Combinatorics Book 28) 2012th Edition PDF Free Download
Download Sparsity: Graphs, Structures, and Algorithms (Algorithms and Combinatorics Book 28) 2012th Edition 2012 PDF Free
Sparsity: Graphs, Structures, and Algorithms (Algorithms and Combinatorics Book 28) 2012th Edition 2012 PDF Free Download
Download Sparsity: Graphs, Structures, and Algorithms (Algorithms and Combinatorics Book 28) 2012th Edition PDF
Free Download Ebook Sparsity: Graphs, Structures, and Algorithms (Algorithms and Combinatorics Book 28) 2012th Edition
