A graph-theoretic method for organizing overlapping clusters into trees, multiple trees, or extended trees (Q1907945): Difference between revisions

@@ Property / cites work @@
+MAPCLUS: A mathematical programming approach to fitting the ADCLUS model
+Normal rank
@@ Property / cites work @@
+Finding a Maximum Clique in an Arbitrary Graph
@@ Property / cites work: Finding a Maximum Clique in an Arbitrary Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm 457: finding all cliques of an undirected graph
+Normal rank
@@ Property / cites work @@
+Spatial, non-spatial and hybrid models for scaling
+Normal rank
@@ Property / cites work @@
+Extended similarity trees
@@ Property / cites work: Extended similarity trees / rank @@
+Normal rank
@@ Property / cites work @@
+Free trees and bidirectional trees as representations of psychological distance
+Normal rank
@@ Property / cites work @@
+Magnitude ordering of degree complements of certain node pairs in an undirected graph and an algorithm to find a class of maximal subgraphs
+Normal rank
@@ Property / cites work @@
+Clique detection for nondirected graphs: Two new algorithms
+Normal rank
@@ Property / cites work @@
+Q4040865
@@ Property / cites work: Q4040865 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Cliques of a graph-variations on the Bron-Kerbosch algorithm
+Normal rank
@@ Property / cites work @@
+A global optimization approach for solving the maximum clique problem
+Normal rank
@@ Property / cites work @@
+Q4773020
@@ Property / cites work: Q4773020 / rank @@
+Normal rank
@@ Property / cites work @@
+A New Algorithm for Generating All the Maximal Independent Sets
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf03040859
+Normal rank
@@ Property / OpenAlex ID @@
+W2068002458
@@ Property / OpenAlex ID: W2068002458 / rank @@
+Normal rank