Polychotomic encoding: A better quasi-optimal bit-vector encoding of tree hierarchies

DOI10.1007/3-540-47993-7_23MaRDI QIDQ3046761zbMATH OpenFDO

Authors Robert E. Filman

Publication date 12 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2374/23740545.htm

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10) Computing methodologies and applications (68U99)

Recommendations

• Generalized Polychotomic Encoding: A Very Short Bit-Vector Encoding of Tree Hierarchies
• A compact encoding of unordered binary trees
• A uniform paradigm to succinctly encode various families of trees
• OPTIMAL PARALLEL ENCODING AND DECODING ALGORITHMS FOR TREES
• Linear-time algorithms for encoding trees as sequences of node labels

Cited in

(5)

• Computational aspects of the 2-dimension of partially ordered sets
• Generalized hybrid encoding of polyhierarchical structures
• Generalized Polychotomic Encoding: A Very Short Bit-Vector Encoding of Tree Hierarchies
• Topological aspects of matrix abduction. II
• The complexity of embedding orders into small products of chains

This page was built for publication: Polychotomic encoding: A better quasi-optimal bit-vector encoding of tree hierarchies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3046761)