Articles liés à Sparsity: Graphs, Structures, and Algorithms
Synopsis
This book offers a systematic study of sparse graphs and sparse finite structures. Although the notion of sparsity appears in various contexts and is typical of a fuzzy notion, the authors present a unifying classification of general classes of structures.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 79,10
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délais
Résultats de recherche pour Sparsity: Graphs, Structures, and Algorithms
Image d'archives
Sparsity: Graphs, Structures, and Algorithms (Algorithms and Combinatorics, 28, Band 28)
Edité par
Springer, 2012
ISBN 10 : 3642278744
ISBN 13 : 9783642278747
Ancien ou d'occasion
Couverture rigide
Vendeur : Ammareal, Morangis, France
Évaluation du vendeur 5 sur 5 étoiles
Hardcover. Etat : 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 réf. du vendeur F-933-897
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Sparsity
Edité par
Springer Berlin Heidelberg, 2012
ISBN 10 : 3642278744
ISBN 13 : 9783642278747
Neuf
Couverture rigide
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Gebunden. 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 5055378
Quantité disponible : Plus de 20 disponibles
Image d'archives
Sparsity: Graphs, Structures, and Algorithms (Algorithms and Combinatorics, 28)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9783642278747_new
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Sparsity : Graphs, Structures, and Algorithms
Edité par
Springer Berlin Heidelberg, 2012
ISBN 10 : 3642278744
ISBN 13 : 9783642278747
Neuf
Couverture rigide
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. 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 9783642278747
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Sparsity
Edité par
Springer Berlin Heidelberg Apr 2012, 2012
ISBN 10 : 3642278744
ISBN 13 : 9783642278747
Neuf
Couverture rigide
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. 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 9783642278747
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Sparsity
Edité par
Springer Berlin Heidelberg, Springer Berlin Heidelberg Apr 2012, 2012
ISBN 10 : 3642278744
ISBN 13 : 9783642278747
Neuf
Couverture rigide
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : 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 réf. du vendeur 9783642278747
Quantité disponible : 1 disponible(s)
Image d'archives
Sparsity: Graphs, Structures, and Algorithms (Algorithms and Combinatorics, 28)
Vendeur : California Books, Miami, FL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur I-9783642278747
Quantité disponible : Plus de 20 disponibles
Image d'archives
Sparsity: Graphs, Structures, and Algorithms (Algorithms and Combinatorics, 28)
Vendeur : Best Price, Torrance, CA, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. SUPER FAST SHIPPING. N° de réf. du vendeur 9783642278747
Quantité disponible : 2 disponible(s)
Image d'archives
Ne et il:Sparsity (eng)
impression à la demandeVendeur : Brook Bookstore On Demand, Napoli, NA, Italie
Évaluation du vendeur 5 sur 5 étoiles
Etat : new. Questo è un articolo print on demand. N° de réf. du vendeur 13f9862ec07efbc206a8696aa359d108
Quantité disponible : Plus de 20 disponibles
Image d'archives
Sparsity
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. pp. 484. N° de réf. du vendeur 2658585614
Quantité disponible : 4 disponible(s)