Fast Parallel Recognition of Ultrametrics and Tree Metrics
From MaRDI portal
Publication:4302265
DOI10.1137/0406041zbMath0942.68799OpenAlexW2009023951MaRDI QIDQ4302265
Publication date: 14 August 1994
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0406041
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Related Items (8)
Robinsonian matrices: recognition challenges ⋮ Fitting semiparametric clustering models to dissimilarity data ⋮ Composed degree-distance realizations of graphs ⋮ Composed degree-distance realizations of graphs ⋮ The Banaschewski compactification revisited ⋮ On Contractive Families and a Fixed‐Point Question of Stein ⋮ Distance realization problems with applications to internet tomography ⋮ Relaxed and approximate graph realizations
This page was built for publication: Fast Parallel Recognition of Ultrametrics and Tree Metrics
