An Analysis of Some Graph Theoretical Cluster Techniques
From MaRDI portal
Publication:5606288
DOI10.1145/321607.321608zbMath0206.17701OpenAlexW1979412257MaRDI QIDQ5606288
Publication date: 1970
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2060/19700022113
Graph theory (including graph drawing) in computer science (68R10) Information storage and retrieval of data (68P20)
Related Items
An appraisal of the performance of the MMSC subgraph generation algorithm on a Cyber system 170/720 ⋮ Complexity and performance of a graph theory algorithm for cluster analysis† ⋮ Unsupervised feature selection for efficient exploration of high dimensional data ⋮ Efficiently enumerating all maximal cliques with bit-parallelism ⋮ A clique-detection algorithm based on neighborhoods in graphs ⋮ Jack Minker --- A profile ⋮ Assignment of tools to machines in a flexible manufacturing system ⋮ Maximal independent sets in clique-free graphs ⋮ Intermuscular coupling network analysis of upper limbs based on R-vine copula transfer entropy ⋮ A graph‐theoretic definition of a sociometric clique† ⋮ On the Approximability of the Minimum Weight $t$-partite Clique Problem ⋮ Enumerating maximal cliques in link streams with durations ⋮ A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically ⋮ Tree partitioning under constraints. -- Clustering for vehicle routing problems ⋮ The logical combinatorial approach to pattern recognition, an overview through selected works ⋮ A generalization of maximal independent sets ⋮ Exact approaches for integrated aircraft fleeting and routing at TunisAir ⋮ Some applications of graph theory to clustering ⋮ Hierarchical clustering from principal coordinates: An efficient method for small to very large numbers of objects ⋮ Clique analysis of a tolerance relation ⋮ Cluster generation and grouping using mathematical programming ⋮ Cliques of a graph-variations on the Bron-Kerbosch algorithm ⋮ On the use of complete subgraphs in cluster analysis ⋮ Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection ⋮ An \(n^ 2\) algorithm for determining the bridges of a graph ⋮ A graph b-coloring framework for data clustering ⋮ From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix Spaces ⋮ Considerations on the similarity measures between index terms ⋮ A new backtracking algorithm for generating the family of maximal independent sets of a graph ⋮ The relative neighborhood graph for mixed feature variables ⋮ Clustering to minimize the maximum intercluster distance ⋮ Classic: A hierarchical clustering algorithm based on asymmetric similarities ⋮ A stratificational overlapping cluster scheme ⋮ Finding maximum cliques in arbitrary and in special graphs ⋮ The maximum clique problem
