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.
De la contraportada
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šetril 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.
"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 del vendedor
Sparsity
Publicado por
Springer Berlin Heidelberg, 2014
ISBN 10: 3642427766
ISBN 13: 9783642427763
Nuevo
Tapa blanda
Librería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
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: 5060426
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Sparsity
Publicado por
Springer Berlin Heidelberg Mai 2014, 2014
ISBN 10: 3642427766
ISBN 13: 9783642427763
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. 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: 9783642427763
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: ria9783642427763_new
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Sparsity : Graphs, Structures, and Algorithms
Publicado por
Springer Berlin Heidelberg, 2014
ISBN 10: 3642427766
ISBN 13: 9783642427763
Nuevo
Taschenbuch
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. 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: 9783642427763
Cantidad disponible: 1 disponibles
Imagen de archivo
Ne et il:Sparsity, 1 (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: 79011ff93e7277d35691e1a9e1d45cb4
Cantidad disponible: Más de 20 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-9783642427763
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Sparsity
Publicado por
Springer Berlin Heidelberg, Springer Berlin Heidelberg Mai 2014, 2014
ISBN 10: 3642427766
ISBN 13: 9783642427763
Nuevo
Taschenbuch
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. 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: 9783642427763
Cantidad disponible: 2 disponibles
Imagen de archivo
Sparsity: Graphs, Structures, and Algorithms
Librería: Revaluation Books, Exeter, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: Brand New. 2012 edition. 459 pages. 9.37x6.26x1.18 inches. In Stock. Nº de ref. del artículo: x-3642427766
Cantidad disponible: 2 disponibles
Imagen de archivo
Sparsity: Graphs, Structures, and Algorithms (Algorithms and Combinatorics (28))
Librería: Mispah books, Redhill, SURRE, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
Paperback. Condición: Like New. Like New. book. Nº de ref. del artículo: ERICA77336424277666
Cantidad disponible: 1 disponibles
Imagen de archivo
Sparsity: Graphs, Structures, and Algorithms (Algorithms and Combinatorics, 28)
Librería: Best Price, Torrance, CA, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. SUPER FAST SHIPPING. Nº de ref. del artículo: 9783642427763
Cantidad disponible: 2 disponibles