An improved algorithm for hierarchical clustering using strong components (Q1838311): Difference between revisions

@@ Property / author @@
-Robert Endre Tarjan
@@ Property / author: Robert Endre Tarjan / rank @@
-Normal rank
@@ Property / author @@
+Robert Endre Tarjan
@@ Property / author: Robert Endre Tarjan / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(83)90088-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2086028466
@@ Property / OpenAlex ID: W2086028466 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Minimum Spanning Trees
@@ Property / cites work: Finding Minimum Spanning Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Min and max hierarchical clustering using asymmetric similarity measures
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal parallel verification of minimum spanning trees in logarithmic time
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1838311