A method for the linear recording of graphs

DOI10.1016/0041-5553(63)90418-XMaRDI QIDQ5334309zbMATH OpenOpenAlexFDO

Authors E. Smolenskij

Publication date 1962

Published in USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0041-5553(63)90418-x

zbMATH Keywords

combinatorics

Cited in

(8)

• A reduction algorithm for approximating a (nonmetric) dissimilarity by a tree distance
• A Note on Optimal and Suboptimal Digraph Realizations of Quasidistance Matrices
• An Optimal Diagonal Tree Code
• Nodal distances for rooted phylogenetic trees
• Reconstructing a graph from the boundary distance matrix
• Linear time tree codes
• Path lengths in tree-child time consistent hybridization networks
• The mean value of the squared path-difference distance for rooted phylogenetic trees

This page was built for publication: A method for the linear recording of graphs

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