
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 ...
DETAILS
Sparsity
Graphs, Structures, and Algorithms
Nesetril, Jaroslav, Ossona de Mendez, Patrice
Gebunden, xxiii, 459 S.
XXIII, 459 p. 132 illus., 100 illus. in color.
Sprache: Englisch
235 mm
ISBN-13: 978-3-642-27874-7
Titelnr.: 32095500
Gewicht: 854 g
Springer, Berlin (2012)
Herstelleradresse
Springer Heidelberg
Tiergartenstr. 17
69121 - DE Heidelberg
E-Mail: buchhandel-buch@springer.com