A clustering algorithm based on graph connectivity

DOI10.1016/S0020-0190(00)00142-3zbMath0996.68525WikidataQ60307349 ScholiaQ60307349MaRDI QIDQ1607070

Ron Shamir, Erez Hartuv

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

Related Items

Exploring gene causal interactions using an enhanced constraint-based method, A clustering algorithm based on maximal \(\varTheta\)-distant subtrees, GAPS: A clustering method using a new point symmetry-based distance measure, A graph b-coloring framework for data clustering, Clustering with \(r\)-regular graphs, Simulated annealing based automatic fuzzy clustering combined with ANN classification for analyzing microarray data, Cluster-C, an algorithm for the large-scale clustering of protein sequences based on the extraction of maximal cliques, Hierarchical clustering based on ordinal consistency

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cluster analysis and mathematical programming
• Mathematical classification and clustering
• Multi-Terminal Network Flows
• Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
• Printer graphics for clustering
• k-Components, Clusters and Slicings in Graphs