Artículos relacionados a Sparsity: Graphs, Structures, and Algorithms: 28 (Algorithms...
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.
Comprar nuevo
Ver este artículo
EUR 79,10
EUR 19,49 gastos de envío desde Alemania a España
Destinos, gastos y plazos de envío
Resultados de la búsqueda para Sparsity: Graphs, Structures, and Algorithms: 28 (Algorithms...
Imagen de archivo
Sparsity: Graphs, Structures, and Algorithms (Algorithms and Combinatorics, 28, Band 28)
Librería: Ammareal, Morangis, Francia
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: Très bon. Ancien livre de bibliothèque. Edition 2012. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Edition 2012. Ammareal gives back up to 15% of this item's net price to charity organizations. Nº de ref. del artículo: F-933-897
Cantidad disponible: 1 disponibles
Imagen del vendedor
Sparsity
Publicado por
Springer Berlin Heidelberg, 2012
ISBN 10: 3642278744
ISBN 13: 9783642278747
Nuevo
Tapa dura
Librería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
Gebunden. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. One of the first textbooks on the topic of sparsity - a core area of current discrete mathematicsExtremely useful to both mathematicians and computer scientistsPedagogically excellentThis is the first book devoted to the systemat. Nº de ref. del artículo: 5055378
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Sparsity
Publicado por
Springer Berlin Heidelberg Apr 2012, 2012
ISBN 10: 3642278744
ISBN 13: 9783642278747
Nuevo
Tapa dura
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 Nesetril 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. 484 pp. Englisch. Nº de ref. del artículo: 9783642278747
Cantidad disponible: 2 disponibles
Imagen de archivo
Sparsity: Graphs, Structures, and Algorithms (Algorithms and Combinatorics, 28)
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9783642278747_new
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Sparsity : Graphs, Structures, and Algorithms
Publicado por
Springer Berlin Heidelberg, 2012
ISBN 10: 3642278744
ISBN 13: 9783642278747
Nuevo
Tapa dura
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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 Nesetril 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. Nº de ref. del artículo: 9783642278747
Cantidad disponible: 1 disponibles
Imagen de archivo
Sparsity: Graphs, Structures, and Algorithms (Algorithms and Combinatorics, 28)
Librería: California Books, Miami, FL, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: I-9783642278747
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Ne et il:Sparsity (eng)
Impresión bajo demandaLibrería: Brook Bookstore On Demand, Napoli, NA, Italia
Calificación del vendedor: 5 de 5 estrellas
Condición: new. Questo è un articolo print on demand. Nº de ref. del artículo: 13f9862ec07efbc206a8696aa359d108
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Sparsity
Librería: Books Puddle, New York, NY, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Condición: New. pp. 484. Nº de ref. del artículo: 2658585614
Cantidad disponible: 4 disponibles
Imagen de archivo
Sparsity
Impresión bajo demandaLibrería: Majestic Books, Hounslow, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Print on Demand pp. 484 132 Illus. (100 Col.). Nº de ref. del artículo: 51006929
Cantidad disponible: 4 disponibles
Imagen del vendedor
Sparsity
Publicado por
Springer Berlin Heidelberg, Springer Berlin Heidelberg Apr 2012, 2012
ISBN 10: 3642278744
ISBN 13: 9783642278747
Nuevo
Tapa dura
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 484 pp. Englisch. Nº de ref. del artículo: 9783642278747
Cantidad disponible: 1 disponibles