Encyclopedia of Algorithms

Living Edition
| Editors: Ming-Yang Kao

Amortized Analysis on Enumeration Algorithms

  • Takeaki UnoEmail author
Living reference work entry
DOI: https://doi.org/10.1007/978-3-642-27848-8_730-1

Years and Authors of Summarized Original Work

1998; Uno

Problem Definition

Let \(\mathcal{A}\)


Amortized analysis Recursion Enumeration tree Delay 
This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Birmele E, Ferreira RA, Grossi R, Marino A, Pisanti N, Rizzi R, Sacomoto G (2013) Optimal listing of cycles and st-paths in undirected graphs. SODA 2013:1884–1896Google Scholar
  2. 2.
    Ferreira RA, Grossi R, Rizzi R (2011) Output-sensitive listing of bounded-size trees in undirected graphs. ESA 2011:275–286MathSciNetGoogle Scholar
  3. 3.
    Shioura A, Tamura A, Uno T (1997) An optimal algorithm for scanning all spanning trees of undirected graphs. SIAM J Comput 26:678–692CrossRefzbMATHMathSciNetGoogle Scholar
  4. 4.
    Uno T (1998) New approach for speeding up enumeration algorithms. LNCS 1533:287–296MathSciNetGoogle Scholar
  5. 5.
    Uno T (1999) A new approach for speeding up enumeration algorithms and its application for matroid bases. LNCS 1627:349–359MathSciNetGoogle Scholar
  6. 6.
    Uno T (2014) A new approach to efficient enumeration by push-out amortization. arXiv:1407.3857Google Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  1. 1.National Institute of InformaticsChiyoda, TokyoJapan