Items related to Sparsity: Graphs, Structures, and Algorithms (Algorithms...

Sparsity: Graphs, Structures, and Algorithms (Algorithms and Combinatorics, 28) - Softcover

 
9783642427763: Sparsity: Graphs, Structures, and Algorithms (Algorithms and Combinatorics, 28)
View all copies of this ISBN edition:
 
 
This book offers a systematic study of sparse graphs and sparse finite structures. Although the notion of sparsity appears in various contexts and is typical of a fuzzy notion, the authors present a unifying classification of general classes of structures.

"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.

Review:

From the reviews:

“This well-crafted and well-written work ... brings the authors’ vast knowledge, expertise, taste, and judgment to bear on an increasingly important and mainstream subject. ... This is a much-needed book devoted to the systematic study of sparse graphs and sparse classes of structures. ... This is an important and useful book. It contains a wealth of up-to-date material, some of which is not readily available in research papers. ... A researcher in graph theory or related fields will find this an excellent reference work.” (József Balogh, Mathematical Reviews, March, 2013)

“This is an excellent and useful book for all researchers in mathematics, computer science, logic, and even in any field in physical science, who seek the tools available for analysis of the properties of discrete structures, and particularly, sparse structures.” (Tadashi Sakuma, zbMATH, Vol. 1268, 2013)

“The book is very well written and diagrammed to beautifully present the theory supporting the study of sparse and dense objects. ... the book contains up-to-date research topics laid out in an amazing chain of thoughts. Almost every chapter ends with exercises, aiding professors in advanced graduate courses. The extensive list of references, together with conjectures and open problems, offers professors, students, and researchers ... profound knowledge on the sparsity of graphs, all in one great book.” (Andre Maximo, Computing Reviews, October, 2012)

"About this title" may belong to another edition of this title.

  • PublisherSpringer
  • Publication date2014
  • ISBN 10 3642427766
  • ISBN 13 9783642427763
  • BindingPaperback
  • Number of pages482

Other Popular Editions of the Same Title

9783642278747: Sparsity: Graphs, Structures, and Algorithms (Algorithms and Combinatorics, 28)

Featured Edition

ISBN 10:  3642278744 ISBN 13:  9783642278747
Publisher: Springer, 2012
Hardcover

Top Search Results from the AbeBooks Marketplace

Seller Image

Neetil, Jaroslav
Published by Springer (2014)
ISBN 10: 3642427766 ISBN 13: 9783642427763
New Soft Cover Quantity: 10
Seller:
booksXpress
(Bayonne, NJ, U.S.A.)

Book Description Soft Cover. Condition: new. Seller Inventory # 9783642427763

More information about this seller | Contact seller

Buy New
US$ 98.26
Convert currency

Add to Basket

Shipping: FREE
Within U.S.A.
Destination, rates & speeds
Stock Image

Ne?et?il, Jaroslav
Published by Springer (2014)
ISBN 10: 3642427766 ISBN 13: 9783642427763
New Softcover Quantity: 1
Seller:
Books Unplugged
(Amherst, NY, U.S.A.)

Book Description Condition: New. Buy with confidence! Book is in new, never-used condition. Seller Inventory # bk3642427766xvz189zvxnew

More information about this seller | Contact seller

Buy New
US$ 116.20
Convert currency

Add to Basket

Shipping: FREE
Within U.S.A.
Destination, rates & speeds
Stock Image

Jaroslav NeŔetŠil
Published by Springer (2014)
ISBN 10: 3642427766 ISBN 13: 9783642427763
New Softcover Quantity: > 20
Print on Demand
Seller:
Ria Christie Collections
(Uxbridge, United Kingdom)

Book Description Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Seller Inventory # ria9783642427763_lsuk

More information about this seller | Contact seller

Buy New
US$ 103.84
Convert currency

Add to Basket

Shipping: US$ 12.43
From United Kingdom to U.S.A.
Destination, rates & speeds
Stock Image

Ne?et?il, Jaroslav
Published by Springer (2014)
ISBN 10: 3642427766 ISBN 13: 9783642427763
New Softcover Quantity: 1
Seller:
Book Deals
(Tucson, AZ, U.S.A.)

Book Description Condition: New. New! This book is in the same immaculate condition as when it was published. Seller Inventory # 353-3642427766-new

More information about this seller | Contact seller

Buy New
US$ 124.72
Convert currency

Add to Basket

Shipping: FREE
Within U.S.A.
Destination, rates & speeds
Seller Image

Patrice Ossona de Mendez
ISBN 10: 3642427766 ISBN 13: 9783642427763
New Taschenbuch Quantity: 2
Print on Demand
Seller:
BuchWeltWeit Ludwig Meier e.K.
(Bergisch Gladbach, Germany)

Book Description 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

More information about this seller | Contact seller

Buy New
US$ 100.22
Convert currency

Add to Basket

Shipping: US$ 24.61
From Germany to U.S.A.
Destination, rates & speeds
Seller Image

Jaroslav Ne etril|Patrice Ossona de Mendez
Published by Springer Berlin Heidelberg (2014)
ISBN 10: 3642427766 ISBN 13: 9783642427763
New Softcover Quantity: > 20
Print on Demand
Seller:
moluna
(Greven, Germany)

Book Description 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

More information about this seller | Contact seller

Buy New
US$ 87.17
Convert currency

Add to Basket

Shipping: US$ 52.42
From Germany to U.S.A.
Destination, rates & speeds
Seller Image

Patrice Ossona de Mendez
Published by Springer Berlin Heidelberg (2014)
ISBN 10: 3642427766 ISBN 13: 9783642427763
New Taschenbuch Quantity: 1
Seller:
AHA-BUCH GmbH
(Einbeck, Germany)

Book Description 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

More information about this seller | Contact seller

Buy New
US$ 104.90
Convert currency

Add to Basket

Shipping: US$ 35.30
From Germany to U.S.A.
Destination, rates & speeds
Stock Image

Ne etril, Jaroslav/ De Mendez, Patrice Ossona
Published by Springer Verlag (2014)
ISBN 10: 3642427766 ISBN 13: 9783642427763
New Paperback Quantity: 2
Seller:
Revaluation Books
(Exeter, United Kingdom)

Book Description Paperback. Condition: Brand New. 2012 edition. 459 pages. 9.37x6.26x1.18 inches. In Stock. Seller Inventory # x-3642427766

More information about this seller | Contact seller

Buy New
US$ 137.30
Convert currency

Add to Basket

Shipping: US$ 12.46
From United Kingdom to U.S.A.
Destination, rates & speeds