Sparsity: Graphs, Structures, and Algorithms: 28 (Algorithms and Combinatorics, 28) - Image 1

£66.64

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

Name: Sparsity: Graphs, Structures, and Algorithms: 28 (Algorithms and Combinatorics, 28)
Brand: Springer
Price: 66.64 GBP
Availability: InStock

Algorithms

This is the most expensive it has ever been. Walk away.

£67 today · previous high £67 · all-time low £65

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 30 days • 30 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 30 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £65 (26 days, 86.7%)

Price range: £65 - £67

Price levels: 2 different prices over 30 days

Description

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.

Product Specifications

Brand: Springer
Format: paperback
ASIN: 3642427766
Category: Books > Subjects > Computing & Internet > Programming > Algorithms
Domain: Amazon UK
Publication Date: 09 May 2014
Listed Since: 03 April 2014

Barcode

No barcode data available

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

This is the most expensive it has ever been. Walk away.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Compressed Sensing & Sparse Filtering (Signals and Communication Technology)

Topics in Discrete Mathematics: Dedicated to Jarik Nešetril on the Occasion of his 60th birthday: 26 (Algorithms and Combinatorics, 26)

Sparse Representation, Modeling and Learning in Visual Recognition: Theory, Algorithms and Applications (Advances in Computer Vision and Pattern Recognition)

Sparse Representation, Modeling and Learning in Visual Recognition: Theory, Algorithms and Applications (Advances in Computer Vision and Pattern Recognition)

Optimal Analysis of Structures by Concepts of Symmetry and Regularity

Graph Separators, with Applications (Frontiers in Computer Science)

Lectures on Discrete Geometry: 212 (Graduate Texts in Mathematics, 212)

Algorithmic Graph Theory

Matroid Theory and its Applications in Electric Network Theory and in Statics: 6 (Algorithms and Combinatorics, 6)

Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications

Theory and Application of Graphs: 10 (Network Theory and Applications, 10)

Sequential and Parallel Algorithms and Data Structures: The Basic Toolbox

Graphs, Dioids and Semirings: New Models and Algorithms: 41 (Operations Research/Computer Science Interfaces Series, 41)

Graphs, Dioids and Semirings: New Models and Algorithms: 41 (Operations Research/Computer Science Interfaces Series, 41)

Sparse Grids and Applications - Munich 2012: 97 (Lecture Notes in Computational Science and Engineering, 97)

Direct Methods for Sparse Linear Systems (Fundamentals of Algorithms, Series Number 2)

Guide to Graph Colouring: Algorithms and Applications (Texts in Computer Science)

Combinatorial Machine Learning: A Rough Set Approach: 360 (Studies in Computational Intelligence, 360)

Large-scale Graph Analysis: System, Algorithm and Optimization (Big Data Management)

Mining of Data with Complex Structures: 333 (Studies in Computational Intelligence, 333)

Embeddability in Graphs: 338 (Mathematics and Its Applications, 338)

Fuzzy Discrete Structures: 58 (Studies in Fuzziness and Soft Computing, 58)

State-Space Search: Algorithms, Complexity, Extensions, and Applications

Sparse Grids and Applications - Miami 2016: 123 (Lecture Notes in Computational Science and Engineering, 123)