On the public citation graph

The first subquadratic algorithm for complete linkage clustering

0 signed · 19 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/3-540-60692-0_66openalex-snapshot
Computing hierarchies of clusters from the euclidean minimum spanning tree in linear time
inferredcites →https://doi.org/10.1007/978-1-4612-1098-6openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1007/bfb0015445openalex-snapshot
The first subquadratic algorithm for complete linkage clustering
inferredcites →https://doi.org/10.1016/0378-3758(89)90033-5openalex-snapshot
Algorithms for clustering data
inferredcites →https://doi.org/10.1080/00401706.1990.10484648openalex-snapshot
Algorithms for Clustering Data
inferredcites →https://doi.org/10.1137/0212002openalex-snapshot
Optimal Search in Planar Subdivisions
inferredcites →https://doi.org/10.1145/116873.116880openalex-snapshot
Voronoi diagrams—a survey of a fundamental geometric data structure
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.

What points at this work

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

inferred← citeshttps://doi.org/10.1002/prot.10081openalex-snapshot
Hamming distance geometry of a protein conformational space: Application to the clustering of a 4‐ns molecular dynamics trajectory of the HIV‐1 integrase catalytic core
inferred← citeshttps://doi.org/10.1007/11430919_45openalex-snapshot
Speeding-Up Hierarchical Agglomerative Clustering in Presence of Expensive Metrics
inferred← citeshttps://doi.org/10.1007/3-540-60692-0_66openalex-snapshot
Computing hierarchies of clusters from the euclidean minimum spanning tree in linear time
inferred← citeshttps://doi.org/10.1007/bfb0029980openalex-snapshot
Optimal algorithms for complete linkage clustering in d dimensions
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50006-1openalex-snapshot
Voronoi Diagrams**Partially supported by the Deutsche Forschungsgemeinschaft, grant K1 655 2-2.
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00179-4openalex-snapshot
Optimal computation of the Voronoi diagram of disjoint clusters
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00239-0openalex-snapshot
Optimal algorithms for complete linkage clustering in d dimensions
inferred← citeshttps://doi.org/10.1023/a:1015279009755openalex-snapshot
Multi-Level Clustering and its Visualization for Exploratory Spatial Analysis
inferred← citeshttps://doi.org/10.3233/ida-130620openalex-snapshot
Unsupervised categorization of human motion sequences
inferred← citeshttps://doi.org/10.5555/314613.315030openalex-snapshot
Fast hierarchical clustering and other applications of dynamic closest pairs
showing the first 10 of 11 · page through all 11
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.