Ordering Problems in Trees and Their Applications to Tree-Structured Operations or Files.

摘要

Ordering problems in oriented and free trees are considered. An optimal ordering of vertices can minimize the working space needed to evaluate a tree-structured set of operations. Other ordering problems, related to access time minimization of tree-structured files on linear access stores, are briefly discussed.