On the public citation graph

Fast Parallel Recognition of Ultrametrics and Tree Metrics

https://doi.org/10.1137/0406041
0 signed · 34 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01840376openalex-snapshot
Efficient parallel algorithms for graph problems
inferredcites →https://doi.org/10.1007/bf02293654openalex-snapshot
Additive Similarity Trees
inferredcites →https://doi.org/10.1016/0020-0190(89)90216-0openalex-snapshot
A fast algorithm for constructing trees from distance matrices
inferredcites →https://doi.org/10.1016/0022-2496(78)90029-9openalex-snapshot
Free trees and bidirectional trees as representations of psychological distance
inferredcites →https://doi.org/10.1016/0095-8956(74)90047-1openalex-snapshot
A note on the metric properties of trees
inferredcites →https://doi.org/10.1016/0196-8858(86)90038-2openalex-snapshot
Reconstructing the shape of a tree from observed dissimilarity data
inferredcites →https://doi.org/10.1016/0378-3758(89)90033-5openalex-snapshot
Algorithms for clustering data
inferredcites →https://doi.org/10.1016/s0021-9800(69)80092-xopenalex-snapshot
A note on the tree realizability of a distance matrix
inferredcites →https://doi.org/10.1090/qam/265210openalex-snapshot
Properties of the distance matrix of a tree
inferredcites →https://doi.org/10.1090/qam/414405openalex-snapshot
The distance matrix of a graph and its tree realization
inferredcites →https://doi.org/10.1109/tc.1987.1676869openalex-snapshot
New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM
inferredcites →https://doi.org/10.1137/0217079openalex-snapshot
On Finding Lowest Common Ancestors: Simplification and Parallelization
inferredcites →https://doi.org/10.1137/0403001openalex-snapshot
Recognition of Tree Metrics
inferredcites →https://doi.org/10.1137/0605014openalex-snapshot
A Note on Optimal and Suboptimal Digraph Realizations of Quasidistance Matrices
inferredcites →https://doi.org/10.2307/2981629openalex-snapshot
A Review of Hierarchical Classification

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/cpe.3355openalex-snapshot
GPU‐UPGMA: high‐performance computing for UPGMA algorithm based on graphics processing units
inferred← citeshttps://doi.org/10.1006/jagm.2000.1090openalex-snapshot
Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition
inferred← citeshttps://doi.org/10.1006/jcss.2001.1785openalex-snapshot
Distance Realization Problems with Applications to Internet Tomography
inferred← citeshttps://doi.org/10.1007/11535294_30openalex-snapshot
A Fast Technique for Constructing Evolutionary Tree with the Application of Compact Sets
inferred← citeshttps://doi.org/10.1007/3-540-68535-9_34openalex-snapshot
Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices
inferred← citeshttps://doi.org/10.1007/978-3-030-79987-8_1openalex-snapshot
Relaxed and Approximate Graph Realizations
inferred← citeshttps://doi.org/10.1007/978-3-030-79987-8_5openalex-snapshot
Composed Degree-Distance Realizations of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-032-26465-7_5openalex-snapshot
Minimum Deviation Distance Realization
inferred← citeshttps://doi.org/10.1007/s00357-017-9230-1openalex-snapshot
Robinsonian Matrices: Recognition Challenges
inferred← citeshttps://doi.org/10.1007/s00453-022-01055-2openalex-snapshot
Composed Degree-Distance Realizations of Graphs
inferred← citeshttps://doi.org/10.1007/s11634-008-0025-4openalex-snapshot
Fitting semiparametric clustering models to dissimilarity data
inferred← citeshttps://doi.org/10.1016/j.jpaa.2019.03.017openalex-snapshot
The Banaschewski compactification revisited
inferred← citeshttps://doi.org/10.1016/j.jpdc.2009.04.008openalex-snapshot
Efficient parallel branch-and-bound algorithm for constructing minimum ultrametric trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114810openalex-snapshot
Graph realization of distance sets
inferred← citeshttps://doi.org/10.1023/a:1009885610075openalex-snapshot
Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices
inferred← citeshttps://doi.org/10.1109/hpcasia.2005.65openalex-snapshot
Parallel branch-and-bound algorithm for constructing evolutionary trees from distance matrix
inferred← citeshttps://doi.org/10.1109/hpcc.2012.120openalex-snapshot
Parallel UPGMA Algorithm on Graphics Processing Units Using CUDA
inferred← citeshttps://doi.org/10.1109/spdp.1992.242746openalex-snapshot
Fast parallel algorithm for the single link heuristics of hierarchical clustering
inferred← citeshttps://doi.org/10.1112/s0025579300000395openalex-snapshot
On Contractive Families and a Fixed‐Point Question of Stein
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.