|
Books > Science & Mathematics > Mathematics > Mathematical foundations
|
Buy Now
Sparsity - Graphs, Structures, and Algorithms (Paperback, 2012 ed.)
Loot Price: R2,820
Discovery Miles 28 200
|
|
|
Sparsity - Graphs, Structures, and Algorithms (Paperback, 2012 ed.)
Series: Algorithms and Combinatorics, 28
Expected to ship within 10 - 15 working days
|
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.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
|
You might also like..
|
Email address subscribed successfully.
A activation email has been sent to you.
Please click the link in that email to activate your subscription.
Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
