Sparsity: Graphs, Structures, and Algorithms: 28 (Algorithms and Combinatorics, 28) - Tapa dura

Libro 4 de 8: Algorithms and Combinatorics

Nešetřil, Jaroslav; Ossona De Mendez, Patrice

 
9783642278747: Sparsity: Graphs, Structures, and Algorithms: 28 (Algorithms and Combinatorics, 28)

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

Acerca del autor

Charlotte y Peter Fiell son dos autoridades en historia, teoría y crítica del diseño y han escrito más de sesenta libros sobre la materia, muchos de los cuales se han convertido en éxitos de ventas. También han impartido conferencias y cursos como profesores invitados, han comisariado exposiciones y asesorado a fabricantes, museos, salas de subastas y grandes coleccionistas privados de todo el mundo. Los Fiell han escrito numerosos libros para TASCHEN, entre los que se incluyen 1000 Chairs, Diseño del siglo XX, El diseño industrial de la A a la Z, Scandinavian Design y Diseño del siglo XXI.

De la contraportada

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

"Sobre este título" puede pertenecer a otra edición de este libro.

Otras ediciones populares con el mismo título

9783642427763: Sparsity: Graphs, Structures, and Algorithms: 28 (Algorithms and Combinatorics)

Edición Destacada

ISBN 10:  3642427766 ISBN 13:  9783642427763
Editorial: Springer, 2014
Tapa blanda