Sparsity: Graphs, Structures, and Algorithms (Algorithms and Combinatorics, 28) - Softcover
Book 4 of 8: Algorithms and Combinatorics
Synopsis
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 this title" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Sparsity: Graphs, Structures, and Algorithms (Algorithms...
Stock Image
Sparsity (eng)
Print on DemandSeller: Brook Bookstore On Demand, Napoli, NA, Italy
Seller rating 4 out of 5 stars
Condition: new. Questo è un articolo print on demand. Seller Inventory # 79011ff93e7277d35691e1a9e1d45cb4
Buy New
US$ 94.99
US$ 9.43 shipping
Ships from Italy to U.S.A.
Ships from Italy to U.S.A.
Quantity: Over 20 available
Stock Image
Sparsity: Graphs, Structures, and Algorithms (Algorithms and Combinatorics, 28)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783642427763_new
Buy New
US$ 113.59
US$ 16.33 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Sparsity
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. pp. xxiii + 459 Index. Seller Inventory # 26142288064
Stock Image
Sparsity
Print on DemandSeller: Majestic Books, Hounslow, United Kingdom
Seller rating 4 out of 5 stars
Condition: New. Print on Demand pp. xxiii + 459 132 Illus. (100 Col.). Seller Inventory # 135043871
Buy New
US$ 131.25
US$ 8.86 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 4 available
Seller Image
Sparsity
Published by
Springer, Springer Mai 2014, 2014
ISBN 10: 3642427766
ISBN 13: 9783642427763
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 484 pp. Englisch. Seller Inventory # 9783642427763
Buy New
US$ 116.90
US$ 27.11 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 2 available
Stock Image
Sparsity
Print on DemandSeller: Biblios, Frankfurt am main, HESSE, Germany
Seller rating 4 out of 5 stars
Condition: New. PRINT ON DEMAND pp. xxiii + 459. Seller Inventory # 18142288074
Buy New
US$ 138.73
US$ 11.73 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 4 available
Seller Image
Sparsity
Published by
Springer Berlin Heidelberg, 2014
ISBN 10: 3642427766
ISBN 13: 9783642427763
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. One of the first textbooks on the topic of sparsity - a core area of current discrete mathematicsExtremely useful to both mathematicians and computer scientistsPedagogically excellentThis is the first book devoted to the systemat. Seller Inventory # 5060426
Buy New
US$ 101.38
US$ 57.74 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available
Stock Image
Sparsity: Graphs, Structures, and Algorithms
Seller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: Brand New. 2012 edition. 459 pages. 9.37x6.26x1.18 inches. In Stock. Seller Inventory # x-3642427766
Buy New
US$ 163.21
US$ 17.04 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 2 available
Seller Image
Sparsity | Graphs, Structures, and Algorithms
Seller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Sparsity | Graphs, Structures, and Algorithms | Jaroslav Neżetżil (u. a.) | Taschenbuch | Algorithms and Combinatorics | xxiii | Englisch | 2014 | Springer | EAN 9783642427763 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Seller Inventory # 105295022
Buy New
US$ 104.65
US$ 82.51 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 5 available
Seller Image
Sparsity
Published by
Springer, Springer Mai 2014, 2014
ISBN 10: 3642427766
ISBN 13: 9783642427763
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 484 pp. Englisch. Seller Inventory # 9783642427763
Buy New
US$ 116.90
US$ 70.72 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 1 available