Sparsity pp 145-174 | Cite as


  • Jaroslav Nešetřil
  • Patrice Ossona de Mendez
Part of the Algorithms and Combinatorics book series (AC, volume 28)


The local properties of structures are frequently studied by means of decompositions: the large structure is cut into (hopefully simpler)pieces whose properties are then studied together with the interconnections between pieces. Several decomposition schemes can be considered. For example, one can stress the regularity of the interconnections of the pieces as in modular decomposition of graphs (a recursive partition into modules such that, for each module, the neighborhoods outside the module of the vertices within the module are all equal [206, 266, 330]). As another example, one can consider a family of overlapping simple pieces covering the structure, in the spirit of the coherency between charts in topological atlases, such as the gluing axiom of sheaves [320] or the arrow construction for the category of labeled rooted forest and the category of labeled Feynman graphs [290].


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Jaroslav Nešetřil
    • 1
  • Patrice Ossona de Mendez
    • 2
  1. 1.Computer Science Institute of Charles University (IUUK) Department of Applied MathematicsCharles UniversityPragueCzech Republic
  2. 2.Mathématique Sociales (UMR 8557)CNRS Centre d’Analyse et deParisFrance

Personalised recommendations