Items related to Sparsity: Graphs, Structures, and Algorithms (Algorithms...
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.
Search results for Sparsity: Graphs, Structures, and Algorithms (Algorithms...
Stock Image
Ne et il:Sparsity, 1 (eng)
Print on DemandSeller: Brook Bookstore On Demand, Napoli, NA, Italy
Seller rating 5 out of 5 stars
Condition: new. Questo è un articolo print on demand. Seller Inventory # 79011ff93e7277d35691e1a9e1d45cb4
Quantity: Over 20 available
Stock Image
Sparsity: Graphs, Structures, and Algorithms (Algorithms and Combinatorics, 28)
Seller: Best Price, Torrance, CA, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. SUPER FAST SHIPPING. Seller Inventory # 9783642427763
Quantity: 2 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
Quantity: Over 20 available
Stock Image
Sparsity: Graphs, Structures, and Algorithms (Algorithms and Combinatorics, 28)
Seller: California Books, Miami, FL, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # I-9783642427763
Quantity: Over 20 available
Seller Image
Sparsity
Published by
Springer Berlin Heidelberg 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
Quantity: 2 available
Seller Image
Sparsity
Published by
Springer Berlin Heidelberg, 2014
ISBN 10: 3642427766
ISBN 13: 9783642427763
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 5 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
Quantity: Over 20 available
Seller Image
Sparsity
Published by
Springer Berlin Heidelberg, Springer Berlin Heidelberg 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. 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
Quantity: 2 available
Seller Image
Sparsity : Graphs, Structures, and Algorithms
Published by
Springer Berlin Heidelberg, 2014
ISBN 10: 3642427766
ISBN 13: 9783642427763
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Seller Inventory # 9783642427763
Quantity: 1 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
Quantity: 2 available
Stock Image
Sparsity: Graphs, Structures, and Algorithms (Algorithms and Combinatorics (28))
Seller: Mispah books, Redhill, SURRE, United Kingdom
Seller rating 4 out of 5 stars
Paperback. Condition: Like New. Like New. book. Seller Inventory # ERICA77336424277666
Quantity: 1 available