Fast Parallel Recognition of Ultrametrics and Tree Metrics

DOI10.1137/0406041MaRDI QIDQ4302265zbMATH OpenOpenAlexFDO

Authors Elias Dahlhaus

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

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Cited in

(9)

• Distance realization problems with applications to internet tomography
• Relaxed and approximate graph realizations
• The Banaschewski compactification revisited
• Robinsonian matrices: recognition challenges
• On Contractive Families and a Fixed‐Point Question of Stein
• Fitting semiparametric clustering models to dissimilarity data
• Composed degree-distance realizations of graphs
• Composed degree-distance realizations of graphs
• Graph realization of distance sets

This page was built for publication: Fast Parallel Recognition of Ultrametrics and Tree Metrics

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