A method for the linear recording of graphs

DOI10.1016/0041-5553(63)90418-XzbMath0127.24601OpenAlexW2058115577MaRDI QIDQ5334309

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

Related Items (7)

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

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