A graph-theoretic method for organizing overlapping clusters into trees, multiple trees, or extended trees
- 1 September 1995
- journal article
- Published by Springer Nature in Journal of Classification
- Vol. 12 (2) , 283-313
- https://doi.org/10.1007/bf03040859
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- A global optimization approach for solving the maximum clique problemInternational Journal of Computer Mathematics, 1990
- On the relation between common and distinctive feature models.Psychological Review, 1987
- Finding a Maximum Clique in an Arbitrary GraphSIAM Journal on Computing, 1986
- Magnitude ordering of degree complements of certain node pairs in an undirected graph and an algorithm to find a class of maximal subgraphsComputers and Electrical Engineering, 1979
- Additive clustering: Representation of similarities as combinations of discrete overlapping properties.Psychological Review, 1979
- Free trees and bidirectional trees as representations of psychological distanceJournal of Mathematical Psychology, 1978
- A New Algorithm for Generating All the Maximal Independent SetsSIAM Journal on Computing, 1977
- Features of similarity.Psychological Review, 1977
- Cliques of a graph-variations on the Bron-Kerbosch algorithmInternational Journal of Parallel Programming, 1976
- Algorithm 457: finding all cliques of an undirected graphCommunications of the ACM, 1973