Sparsity: Graphs, Structures, and Algorithms: 28 - Rilegato

Nesetril, Jaroslav; Ossona De Mendez, Patrice

Rilegato

ISBN 10: 3642278744 ISBN 13: 9783642278747

Casa editrice: Springer Nature, 2012

Riassunto

<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šetril 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>

Su questo libro

Dalla quarta di copertina

<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šetril 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></p>

Dettagli dell'edizione

• Editore: Springer Nature
• Data di pubblicazione: 2012
• Lingua: Inglese
• ISBN 10: 3642278744
• ISBN 13: 9783642278747
• Rilegatura: Copertina rigida
• Numero di pagine: 457
• Contatto del produttore: non disponibile
• Persona responsabile: CMN Printpool Inh. Mathis Neumann; https://www.also.com/ec/cms5/en_6000/6000/index.jsp; ; Friedrich-Karl-Str. 9; Hamburg; Germania