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: 64.36 GBP
Availability: InStock

Mathematical Logic

Price History & Forecast

Last 91 days • 91 data points

Historical

Generating forecast...

Price Distribution

Price distribution over 91 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £64 (90 days, 98.9%)

Price range: £64 - £67

Price levels: 2 different prices over 91 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)

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

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

The Discrepancy Method: Randomness and Complexity

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

Efficient Algorithms for Listing Combinatorial Structures: 5 (Distinguished Dissertations in Computer Science, Series Number 5)

Treewidth, Kernels, and Algorithms: Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday: 12160 (Lecture Notes in Computer Science, 12160)

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

Spectral Clustering and Biclustering: Learning Large Graphs and Contingency Tables

Combinatorial Scientific Computing

Modelling and Performance Analysis of Cyclic Systems: 241 (Studies in Systems, Decision and Control, 241)

A Java Library of Graph Algorithms and Optimization (Discrete Mathematics and Its Applications)

Analytic Combinatorics: A Multidimensional Approach (Discrete Mathematics and Its Applications)

Graph-Theoretic Concepts in Computer Science: 23rd International Workshop, WG'97, Berlin, Germany, June 18-20, 1997. Proceedings: 1335 (Lecture Notes in Computer Science, 1335)

Algorithms and Theory of Computation Handbook, Volume 2: Special Topics and Techniques (Chapman & Hall/CRC Applied Algorithms and Data Structures series)

New Perspectives in Algebraic Combinatorics: 38 (Mathematical Sciences Research Institute Publications, Series Number 38)

Structural, Syntactic, and Statistical Pattern Recognition: Joint IAPR International Workshops, SSPR 2004 and SPR 2004, Lisbon, Portugal, August ... (Lecture Notes in Computer Science, 3138)

Sperner Theory: 65 (Encyclopedia of Mathematics and its Applications, Series Number 65)

Universal Compression and Retrieval: 274 (Mathematics and Its Applications, 274)

Algorithms as a Basis of Modern Applied Mathematics: 404 (Studies in Fuzziness and Soft Computing, 404)

Data Science and Digital Transformation in the Fourth Industrial Revolution: 929 (Studies in Computational Intelligence, 929)

Intersection and Decomposition Algorithms for Planar Arrangements

Algorithmic Aspects of Graph Connectivity: 123 (Encyclopedia of Mathematics and its Applications, Series Number 123)

Irregularities of Partitions: 8 (Algorithms and Combinatorics, 8)

Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra: In Honour of Peter Paule on his 60th Birthday (Texts & Monographs in Symbolic Computation)

Sequential and Parallel Algorithms and Data Structures: The Basic Toolbox