An Optimal Diagonal Tree Code

DOI10.1137/0604006MaRDI QIDQ4750658zbMATH OpenOpenAlexFDO

Authors Seth Chaiken, A. K. Dewdney, Peter Slater

Publication date 1983

Published in SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0604006

zbMATH Keywords

distance matrixlinear algorithms

Mathematics Subject Classification ID

Trees (05C05) Algorithms in computer science (68W99) Combinatorial codes (94B25)

Cites work

• A method for the linear recording of graphs
• Diagonal tree codes
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• scientific article; zbMATH DE number 3390780 (Why is no real title available?)
• scientific article; zbMATH DE number 3394154 (Why is no real title available?)
• Technologies for constructing intelligent systems. 2: Tools
• The distance matrix of a graph and its tree realization

Cited in

(11)

• On optimal realizations of finite metric spaces by graphs
• A fast algorithm for constructing trees from distance matrices
• A note on distance matrices with unicyclic graph realizations
• Representations of graphs and networks (coding, layouts and embeddings)
• On some relations between 2-trees and tree metrics
• Minimum spanning trees for tree metrics: Abridgements and adjustments
• A Note on Optimal and Suboptimal Digraph Realizations of Quasidistance Matrices
• Tree reconstruction from triplet cover distances
• `Lassoing' a phylogenetic tree. I: Basic properties, shellings, and covers
• On optimal embeddings of metrics in graphs
• Linear time tree codes

This page was built for publication: An Optimal Diagonal Tree Code

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