An Optimal Diagonal Tree Code

DOI10.1137/0604006zbMath0512.05023OpenAlexW1984295406MaRDI QIDQ4750658

A. K. Dewdney, Seth Chaiken, Peter J. 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) Combinatorial codes (94B25) Algorithms in computer science (68W99)

Related Items (11)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The distance matrix of a graph and its tree realization
• Diagonal tree codes
• A method for the linear recording of graphs
• Technologies for constructing intelligent systems. 2: Tools

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