EUR 58,45
  • Statt: EUR 58,94
  • Sie sparen: EUR 0,49 (1%)
  • Alle Preisangaben inkl. MwSt.
Nur noch 1 auf Lager (mehr ist unterwegs).
Verkauf und Versand durch Amazon.
Geschenkverpackung verfügbar.
Sparsity: Graphs, Structu... ist in Ihrem Einkaufwagen hinzugefügt worden
Ihren Artikel jetzt
eintauschen und
EUR 3,10 Gutschein erhalten.
Möchten Sie verkaufen?
Zur Rückseite klappen Zur Vorderseite klappen
Anhören Wird wiedergegeben... Angehalten   Sie hören eine Probe der Audible-Audioausgabe.
Weitere Informationen
Dieses Bild anzeigen

Sparsity: Graphs, Structures, and Algorithms (Algorithms and Combinatorics) (Englisch) Gebundene Ausgabe – 25. April 2012

Alle 2 Formate und Ausgaben anzeigen Andere Formate und Ausgaben ausblenden
Amazon-Preis Neu ab Gebraucht ab
Gebundene Ausgabe
"Bitte wiederholen"
EUR 58,45
EUR 56,99 EUR 52,59
47 neu ab EUR 56,99 3 gebraucht ab EUR 52,59
Jeder kann Kindle Bücher lesen — selbst ohne ein Kindle-Gerät — mit der KOSTENFREIEN Kindle App für Smartphones, Tablets und Computer.


Mehr über die Autoren

Entdecken Sie Bücher, lesen Sie über Autoren und mehr



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)


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.

In diesem Buch (Mehr dazu)
Ausgewählte Seiten ansehen
Buchdeckel | Copyright | Inhaltsverzeichnis | Auszug | Stichwortverzeichnis
Hier reinlesen und suchen:


Noch keine Kundenrezensionen vorhanden.
5 Sterne
4 Sterne
3 Sterne
2 Sterne
1 Sterne