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
Publisher:
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Published:
2012
Language:
English
Alibris ID:
12825657200
Shipping Options:
Standard Shipping: $4.65
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.
Publisher:
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Published:
2012
Language:
English
Alibris ID:
17987851154
Shipping Options:
Standard Shipping: $4.65
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Contains: Illustrations, black & white, Illustrations, color. Algorithms and Combinatorics . XXIII, 459 p. 132 illus., 100 illus. in color. Intended for college/higher education audience. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
Publisher:
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Published:
2012
Language:
English
Alibris ID:
17382680905
Shipping Options:
Standard Shipping: $4.65
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. 459 p. Algorithms and Combinatorics , 28. 100 Illustrations, color; 32 Illustrations, black and white; XXIII, 459 p. 132 illus., 100 illus. in color. Intended for college/higher education audience.
