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

Abstract

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.

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1974
Accession Number
ADA015516

Entities

People

  • A. N. Patrinos
  • S. L. Hakimi

Organizations

  • Northwestern University

Tags

DTIC Thesaurus Topics

  • Access Time
  • Information Science
  • Interdisciplinary Science

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Graph Algorithms and Convex Optimization.
  • Library and Information Science

Technology Areas

  • Space