Sparsity: Graphs, Structures, and Algorithms
Language: English
Published by Springer Verlag, 2014
- Softcover
- New

Seller: Revaluation Books, Exeter, United KingdomRevaluation Books
AbeBooks seller since January 6, 2003
Condition: New
US$ 163.29
Quantity: 2 available
Add to basketItem description from seller
2012 edition. 459 pages. 9.37x6.26x1.18 inches. In Stock.
Seller Inventory # x-3642427766
- Title
- Sparsity: Graphs, Structures, and Algorithms
- Author
- Neetril, Jaroslav/ De Mendez, Patrice Ossona
- Publisher
- Springer Verlag
- Publication year
- 2014
- Condition
- Brand New
- Binding
- Paperback
- Language
- English
- ISBN 10
- 3642427766
- ISBN 13
- 9783642427763
- Item weight
- 0.85 kilograms
- Series
- Book 4 of 8: Algorithms and Combinatorics
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.
"Synopsis" may belong to another edition of this title.
From the Back Cover
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.
"About the title" may belong to another edition of this title.
Revaluation Books
Exeter, United Kingdom
AbeBooks seller since January 6, 2003
Shipping rates from United Kingdom to U.S.A.
| Item | 7 to 14 business days | 2 to 3 business days |
|---|---|---|
| First item | US$ 16.85 | US$ 40.43 |
Payment methods
Seller's business information
Edward Bowditch Ltd
Exstowe, Exton
Exeter, United Kingdom EX3 0PP
Terms of sale
Legal entity name: Edward Bowditch Ltd
Legal entity form: Limited company
Business correspondence address: Exstowe, Exton, Exeter, EX3 0PP
Company registration number: 04916632
VAT registration: GB834241546
Authorised representative: Mr. E. Bowditch
Shipping terms
Orders usually dispatched within two working days. Please note that at this time all domestic United Kingdom orders are sent by trackable UPS courier, we choose not to offer a lower cost alternative.