An Optimal Diagonal Tree Code

DOI10.1137/0604006zbMATH Open0512.05023OpenAlexW1984295406MaRDI QIDQ4750658FDOQ4750658

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) Combinatorial codes (94B25) Algorithms in computer science (68W99)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The distance matrix of a graph and its tree realization
• Title not available (Why is that?)
• Title not available (Why is that?)
• A method for the linear recording of graphs
• Diagonal tree codes
• Technologies for constructing intelligent systems. 2: Tools

Cited In (11)

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

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)