A storage scheme for hierarchic structures | Zendy

W.F. Smyth | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A storage scheme for hierarchic structures

Author(s) -

W.F. Smyth

Publication year - 1974

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/17.2.152

Subject(s) - scheme (mathematics) , representation (politics) , hierarchy , computer science , tree (set theory) , binary tree , descent (aeronautics) , theoretical computer science , binary number , algorithm , data structure , topology (electrical circuits) , mathematics , arithmetic , combinatorics , programming language , mathematical analysis , engineering , politics , political science , economics , law , market economy , aerospace engineering

The representation of a tree by a right-threaded binary tree, as described for example by Knuth (1968, pp. 332 ff), is extended to permit representation of ‘hierarchic structures’ (directed graphs without circuits). This representation corresponds to a compact storage scheme useful both for ascent and descent of the hierarchy.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research