A graph-theoretic method for organizing overlapping clusters into trees, multiple trees, or extended trees

DOI10.1007/BF03040859zbMATH Open0850.92051OpenAlexW2068002458MaRDI QIDQ1907945FDOQ1907945

Authors: J. Douglas Carroll, James E. Corter 

Publication date: 25 February 1996

Published in: Journal of Classification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03040859

Mathematics Subject Classification ID

Applications of graph theory (05C90) Clustering in the social and behavioral sciences (91C20)

Cites Work

• Algorithm 457: finding all cliques of an undirected graph
• Free trees and bidirectional trees as representations of psychological distance
• MAPCLUS: A mathematical programming approach to fitting the ADCLUS model
• Title not available (Why is that?)
• Spatial, non-spatial and hybrid models for scaling
• A New Algorithm for Generating All the Maximal Independent Sets
• Title not available (Why is that?)
• Cliques of a graph-variations on the Bron-Kerbosch algorithm
• Finding a Maximum Clique in an Arbitrary Graph
• A global optimization approach for solving the maximum clique problem
• Clique detection for nondirected graphs: Two new algorithms
• 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
• Title not available (Why is that?)

Cited In (2)

• In memoriam: J. Douglas Carroll, 1939--2011
• In memoriam, J. Douglas Carroll 1939--2011

Uses Software

• MAPCLUS
• Indclus
• Algorithm 457

This page was built for publication: A graph-theoretic method for organizing overlapping clusters into trees, multiple trees, or extended trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1907945)