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

Mathematical Logic

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

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

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 40 days • 40 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 40 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £64 (39 days, 97.5%)

Price range: £64 - £67

Price levels: 2 different prices over 40 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: hardcover
ASIN: 3642278744
Category: Books > Subjects > Science, Nature & Maths > Mathematics > Mathematical Foundations > Mathematical Logic
Domain: Amazon UK
Release Date: 25 April 2012
Listed Since: 30 December 2011

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

Sparse Modeling: Theory, Algorithms, and Applications (Chapman & Hall/CRC Machine Learning & Pattern Recognition)

Algorithms for Sparsity-Constrained Optimization: 261 (Springer Theses, 261)

DIRECT METHODS FOR SPARSE MATRICES 2E (Numerical Mathematics and Scientific Computation)

Graph Theory and Sparse Matrix Computation: 56 (The IMA Volumes in Mathematics and its Applications, 56)

Sparse Coding And Its Applications In Computer Vision

Sparse Sensing and Sparsity Sensed in Multi-sensor Array Applications

De Gruyter Sparse Recovery: Theoretical and Numerical Methods

Efficient Execution of Irregular Dataflow Graphs: Hardware/Software Co-optimization for Probabilistic AI and Sparse Linear Algebra

Data Structures and Algorithms with Python: With an Introduction to Multiprocessing (Undergraduate Topics in Computer Science)

Low-Rank and Sparse Modeling for Visual Analysis

Guide to Graph Algorithms: Sequential, Parallel and Distributed (Texts in Computer Science)

Algorithms for Sparsity-Constrained Optimization: 261 (Springer Theses, 261)

Geometric Combinatorics (IAS/Park City Mathematics) (IAS/Park City Mathematics Series)

Quantitative Graph Theory: Mathematical Foundations and Applications (Discrete Mathematics and Its Applications (Hardcover))

Extremal Finite Set Theory (Discrete Mathematics and Its Applications)

Parameterized Algorithms

Modern Algorithms of Cluster Analysis: 34 (Studies in Big Data, 34)

Extremal Finite Set Theory (Discrete Mathematics and Its Applications)

Discrete Structures and Their Interactions

Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining: 146 (Intelligent Systems Reference Library, 146)

Parameterized Algorithms

Discrete Structures and Their Interactions (Discrete Mathematics and Its Applications)

Data Analysis in Bi-partial Perspective: Clustering and Beyond: 818 (Studies in Computational Intelligence, 818)

An Introduction To The Analysis Of Algorithms (3rd Edition)