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

DOI10.1007/BF03040859MaRDI QIDQ1907945zbMATH OpenOpenAlexFDO

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

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 194075 (Why is no real title available?)
• scientific article; zbMATH DE number 3448387 (Why is no real title available?)
• A New Algorithm for Generating All the Maximal Independent Sets
• A global optimization approach for solving the maximum clique problem
• Algorithm 457: finding all cliques of an undirected graph
• Clique detection for nondirected graphs: Two new algorithms
• Cliques of a graph-variations on the Bron-Kerbosch algorithm
• Extended similarity trees
• Finding a Maximum Clique in an Arbitrary Graph
• Free trees and bidirectional trees as representations of psychological distance
• MAPCLUS: A mathematical programming approach to fitting the ADCLUS model
• Magnitude ordering of degree complements of certain node pairs in an undirected graph and an algorithm to find a class of maximal subgraphs
• Spatial, non-spatial and hybrid models for scaling

Cited in

(2)

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

Describes a project that uses

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)