Abstract
In this chapter we present an overview of the main issues related to enumeration problems and the main techniques to design algorithms and proving their complexity. Among these, we will discuss brute force approaches and basic paradigms, like backtracking, binary partition, and reverse search. Moreover, amortized analysis will be introduced by discussing basic amortization, amortization by children, and push out amortization.
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
Notes
- 1.
If \(T\) is a path, the copy vertex is defined as the root.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2015 Atlantis Press and the authors
About this chapter
Cite this chapter
Marino, A. (2015). Enumeration Algorithms. In: Analysis and Enumeration. Atlantis Studies in Computing, vol 6. Atlantis Press, Paris. https://doi.org/10.2991/978-94-6239-097-3_2
Download citation
DOI: https://doi.org/10.2991/978-94-6239-097-3_2
Published:
Publisher Name: Atlantis Press, Paris
Print ISBN: 978-94-6239-096-6
Online ISBN: 978-94-6239-097-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)