Sparsity Graphs, Structures, and Algorithms /
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...
| Main Authors: | Nešetřil, Jaroslav (Author), Ossona de Mendez, Patrice (Author) |
|---|---|
| Corporate Author: | SpringerLink (Online service) |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2012.
|
| Series: | Algorithms and Combinatorics,
28 |
| Subjects: | |
| Online Access: | Full Text via HEAL-Link |
Similar Items
-
A Course in Topological Combinatorics
by: Longueville, Mark de
Published: (2013) -
Computing the Continuous Discretely Integer-Point Enumeration in Polyhedra /
by: Beck, Matthias, et al.
Published: (2007) -
Computing the Continuous Discretely Integer-Point Enumeration in Polyhedra /
by: Beck, Matthias, et al.
Published: (2015) -
Geometry — Intuitive, Discrete, and Convex A Tribute to László Fejes Tóth /
Published: (2013) -
Ramsey Theory Yesterday, Today, and Tomorrow /
Published: (2011)