Sparsity : graphs, structures, and algorithms /
<p><p>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 o...
में बचाया:
| मुख्य लेखक: | |
|---|---|
| निगमित लेखक: | |
| अन्य लेखक: | |
| स्वरूप: | ई-पुस्तक |
| भाषा: | English |
| प्रकाशित: |
Berlin, Heidelberg
Springer Berlin Heidelberg
2012.
|
| श्रृंखला: | Algorithms and Combinatorics,
28 |
| विषय: | |
| ऑनलाइन पहुंच: | Click here to view the full text content |
| टैग : |
टैग जोड़ें
कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!
|
| सारांश: | <p><p>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.</p><p>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. <br></p><p>Jaroslav Nešetřil is a professor at Charles University, Prague; Patrice Ossona de Mendez is a CNRS researcher et EHESS, Paris.</p><p>This book is related to the material presented by the first author at ICM 2010.</p> |
|---|---|
| भौतिक वर्णन: | 1 online resource (XXIII, 457 pages) 132 illustration, digital. |
| आईएसबीएन: | 9783642278754 |
| आईएसएसएन: | 0937-5511 |