An Analysis of Some Graph Theoretical Cluster Techniques
From MaRDI portal
Cited in
(37)- A graph b-coloring framework for data clustering
- The relative neighborhood graph for mixed feature variables
- Clustering to minimize the maximum intercluster distance
- A stratificational overlapping cluster scheme
- An appraisal of the performance of the MMSC subgraph generation algorithm on a Cyber system 170/720
- Assignment of tools to machines in a flexible manufacturing system
- A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically
- Some applications of graph theory to clustering
- Hierarchical clustering from principal coordinates: An efficient method for small to very large numbers of objects
- Cluster generation and grouping using mathematical programming
- The maximum clique problem
- Efficiently enumerating all maximal cliques with bit-parallelism
- Enumerating maximal cliques in link streams with durations
- Considerations on the similarity measures between index terms
- Jack Minker --- A profile
- Tree partitioning under constraints. -- Clustering for vehicle routing problems
- Unsupervised feature selection for efficient exploration of high dimensional data
- On the use of complete subgraphs in cluster analysis
- An \(n^ 2\) algorithm for determining the bridges of a graph
- Maximal independent sets in clique-free graphs
- Intermuscular coupling network analysis of upper limbs based on R-vine copula transfer entropy
- A clique-detection algorithm based on neighborhoods in graphs
- Complexity and performance of a graph theory algorithm for cluster analysis†
- A graph‐theoretic definition of a sociometric clique†
- Clique analysis of a tolerance relation
- Cliques of a graph-variations on the Bron-Kerbosch algorithm
- Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection
- From independent sets and vertex colorings to isotropic spaces and isotropic decompositions: another bridge between graphs and alternating matrix spaces
- On the approximability of the minimum weight t-partite clique problem
- Exact approaches for integrated aircraft fleeting and routing at TunisAir
- The logical combinatorial approach to pattern recognition, an overview through selected works
- A generalization of maximal independent sets
- Maximum independent set when excluding an induced minor: K₁ + tK₂ and tC₃ C₄
- A bisection method for solving distance-based clustering problems globally
- A new backtracking algorithm for generating the family of maximal independent sets of a graph
- Classic: A hierarchical clustering algorithm based on asymmetric similarities
- Finding maximum cliques in arbitrary and in special graphs
This page was built for publication: An Analysis of Some Graph Theoretical Cluster Techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5606288)
