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 ...
Read More
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.
Read Less
Add this copy of Sparsity: Graphs, Structures, and Algorithms to cart. $93.93, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 2012 by Springer-Verlag Berlin and Heidelberg GmbH & Co. K.
Edition:
2012, Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Publisher:
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Published:
2012
Language:
English
Alibris ID:
12825657200
Shipping Options:
Standard Shipping: $4.99
Trackable Expedited: $9.99
Two Day Air: $29.99
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Print on demand Contains: Illustrations, black & white, Illustrations, color. Algorithms and Combinatorics . XXIII, 459 p. 132 illus., 100 illus. in color. Intended for college/higher education audience.
Add this copy of Sparsity: Graphs, Structures, and Algorithms to cart. $124.96, good condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Newport Coast, CA, UNITED STATES, published 2012 by Springer.
Edition:
2012, Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Add this copy of Sparsity: Graphs, Structures, and Algorithms to cart. $169.88, new condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Newport Coast, CA, UNITED STATES, published 2012 by Springer.
Edition:
2012, Springer-Verlag Berlin and Heidelberg GmbH & Co. K
