Back
On the complexity of algorithms on recursive trees
Authors:
- Jerzy Stanisław Szymański
Abstract
In this paper we consider three types of parameters which characterize the computational complexity of algorithms working on recursive trees. We deal with the path lengths, the degree path lengths and the mean path lengths. © 1990.
- Record ID
- UAM4bcdb153283c499189caf1cc65ccca04
- Author
- Journal series
- Theoretical Computer Science, ISSN 0304-3975
- Issue year
- 1990
- Vol
- 74
- Pages
- 355-361
- ASJC Classification
- ;
- DOI
- DOI:10.1016/0304-3975(90)90084-U Opening in a new tab
- Language
- (en) English
- Score (nominal)
- 0
- Score source
- journalList
- Publication indicators
- = 9; = 9; : 1999 = 1.115; : 2006 (2 years) = 0.843 - 2007 (5 years) =0.898
Share
- Uniform Resource Identifier
- https://researchportal.amu.edu.pl/info/article/UAM4bcdb153283c499189caf1cc65ccca04/
- URN
urn:amu-prod:UAM4bcdb153283c499189caf1cc65ccca04
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or PerishOpening in a new tab system.