Sparsity: Graphs, Structures, and Algorithms - Couverture souple

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

9783642427763: Sparsity: Graphs, Structures, and Algorithms

Couverture souple

ISBN 10 : 3642427766 ISBN 13 : 9783642427763

Editeur : Springer, 2014

Afficher les exemplaires de cette �dition comportant l?ISBN

1 D'occasion

De EUR 143,74

9 Neuf

De EUR 79,10

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.

Les informations fournies dans la section � Synopsis � peuvent faire r�f�rence � une autre �dition de ce titre.

�diteur: Springer
Date d'�dition: 2014
Langue: anglais
ISBN 10: 3642427766
ISBN 13: 9783642427763
Reliure: Broch�
Nombre de pages: 484
Coordonn�es du fabricant: non disponible
Personne responsable: CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Allemagne

Acheter D'occasion

�tat : Comme neuf

Like New

Afficher cet article

EUR 143,74

Autre devise

EUR 28,83 exp�dition depuis Royaume-Uni vers France

Destinations, frais et d�lais

Ajouter au panier

Acheter neuf

Afficher cet article

EUR 79,10

Autre devise

EUR 9,70 exp�dition depuis Allemagne vers France

Destinations, frais et d�lais

Ajouter au panier

Autres �ditions populaires du m�me titre

9783642278747: Sparsity: Graphs, Structures, and Algorithms

Edition pr�sent�e

ISBN 10 : 3642278744 ISBN 13 : 9783642278747
Editeur : Springer-Verlag Berlin and Heide..., 2012
Couverture rigide

R�sultats de recherche pour Sparsity: Graphs, Structures, and Algorithms

Image fournie par le vendeur

Sparsity

Jaroslav Neetril|Patrice Ossona de Mendez

Edit� par Springer Berlin Heidelberg, 2014

ISBN 10 : 3642427766 ISBN 13 : 9783642427763

Neuf Couverture souple

impression � la demande

Vendeur : moluna, Greven, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Etat : 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 r�f. du vendeur 5060426

Contacter le vendeur

Acheter neuf

EUR 79,10

Autre devise

Frais de port : EUR 9,70

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

Sparsity : Graphs, Structures, and Algorithms

Patrice Ossona de Mendez

Edit� par Springer Berlin Heidelberg, 2014

ISBN 10 : 3642427766 ISBN 13 : 9783642427763

Neuf Taschenbuch

Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : 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 r�f. du vendeur 9783642427763

Contacter le vendeur

Acheter neuf

EUR 90,94

Autre devise

Frais de port : EUR 10,99

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Sparsity

Patrice Ossona de Mendez

Edit� par Springer Berlin Heidelberg Mai 2014, 2014

ISBN 10 : 3642427766 ISBN 13 : 9783642427763

Neuf Taschenbuch

impression � la demande

Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : 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 r�f. du vendeur 9783642427763

Contacter le vendeur

Acheter neuf

EUR 90,94

Autre devise

Frais de port : EUR 11

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : 2 disponible(s)

Ajouter au panier

Image d'archives

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

Ne?et?il, Jaroslav; Ossona De Mendez, Patrice

Edit� par Springer, 2014

ISBN 10 : 3642427766 ISBN 13 : 9783642427763

Neuf Couverture souple

Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni

�valuation du vendeur 5 sur 5 �toiles

Etat : New. In. N� de r�f. du vendeur ria9783642427763_new

Contacter le vendeur

Acheter neuf

EUR 97,43

Autre devise

Frais de port : EUR 4,60

De Royaume-Uni vers France

Destinations, frais et d�lais

Quantit� disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

Sparsity

Patrice Ossona de Mendez

Edit� par Springer Berlin Heidelberg, Springer Berlin Heidelberg Mai 2014, 2014

ISBN 10 : 3642427766 ISBN 13 : 9783642427763

Neuf Taschenbuch

Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : 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 r�f. du vendeur 9783642427763

Contacter le vendeur