Abstract
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.
Fast, robust, strong. . . youthful modern times.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Nešetřil, J., de Mendez, P.O. (2012). Core Algorithms. In: Sparsity. Algorithms and Combinatorics, vol 28. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27875-4_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-27875-4_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27874-7
Online ISBN: 978-3-642-27875-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)