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...
Clasificación: | Libro Electrónico |
---|---|
Autores principales: | Nešetřil, Jaroslav (Autor), Ossona de Mendez, Patrice (Autor) |
Autor Corporativo: | SpringerLink (Online service) |
Formato: | Electrónico eBook |
Idioma: | Inglés |
Publicado: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2012.
|
Edición: | 1st ed. 2012. |
Colección: | Algorithms and Combinatorics,
28 |
Temas: | |
Acceso en línea: | Texto Completo |
Ejemplares similares
-
Geometry - Intuitive, Discrete, and Convex A Tribute to László Fejes Tóth /
Publicado: (2013) -
Computing the Continuous Discretely Integer-point Enumeration in Polyhedra /
por: Beck, Matthias, et al.
Publicado: (2007) -
Computing the Continuous Discretely Integer-Point Enumeration in Polyhedra /
por: Beck, Matthias, et al.
Publicado: (2015) -
Ramsey Theory Yesterday, Today, and Tomorrow /
Publicado: (2011) -
A Course in Topological Combinatorics
por: de Longueville, Mark
Publicado: (2013)