Report icon

Report

Linear−time Breadth−first Tree Algorithms: An Exercise in the Arithmetic of Folds and Zips

Abstract:
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.

Actions


Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author
Publisher:
Dept of Computer Science‚ University of Auckland
Publication date:
1993-05-01
UUID:
uuid:f6313e89-7373-49b5-a65c-b29d43d18ec5
Local pid:
cs:2363
Deposit date:
2015-03-12

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP