A graph-theoretic method for organizing overlapping clusters into trees, multiple trees, or extended trees
From MaRDI portal
Publication:1907945
DOI10.1007/BF03040859zbMath0850.92051MaRDI QIDQ1907945
J. Douglas Carroll, James E. Corter
Publication date: 25 February 1996
Published in: Journal of Classification (Search for Journal in Brave)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extended similarity trees
- Magnitude ordering of degree complements of certain node pairs in an undirected graph and an algorithm to find a class of maximal subgraphs
- MAPCLUS: A mathematical programming approach to fitting the ADCLUS model
- Clique detection for nondirected graphs: Two new algorithms
- Spatial, non-spatial and hybrid models for scaling
- Free trees and bidirectional trees as representations of psychological distance
- Finding a Maximum Clique in an Arbitrary Graph
- A global optimization approach for solving the maximum clique problem
- A New Algorithm for Generating All the Maximal Independent Sets
- Cliques of a graph-variations on the Bron-Kerbosch algorithm
- Algorithm 457: finding all cliques of an undirected graph