Sparsity pp 381-396 | Cite as

Core Algorithms

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


An essential part of this book deals with estimates of complexity of algorithms. The aim of this chapter is to describe core algorithms, like the computation of a p-tree-depth decomposition. We shall describe this particular algorithm in a sufficiently precise way to allow an actual implementation of the described algorithms. In order to base our complexity results, we specify our computational model in this chapter.


Input Graph Linear Time Algorithm Tree Depth Core Algorithm List Assignment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


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