Linear−time Breadth−first Tree Algorithms: An Exercise in the Arithmetic of Folds and Zips
- This paper is about an application of the mathematics of the zip, reduce (fold) and accumulate (scan) operations on lists. It gives an account of the derivation of a linear-time breadth-first tree traversal algorithm, and of a subtle and efficient breadth-first tree labelling algorithm.
- Dept of Computer Science‚ University of Auckland
- Publication date:
- Local pid:
- Deposit date:
- Copyright date:
If you are the owner of this record, you can report an update to it here: Report update to this record