Publication:4672747

{{DISPLAYTITLE:Graph Clustering and Minimum Cut Trees

DOI10.1080/15427951.2004.10129093zbMath1098.68095OpenAlexW2030724586MaRDI QIDQ4672747

Kostas Tsioutsiouliklis, Gary William Flake, Robert Endre Tarjan

Publication date: 3 May 2005

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15427951.2004.10129093

zbMATH Keywords

clustering algorithmscitation graphs

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Unnamed Item, Online summarization of dynamic graphs using subjective interestingness for sequential data, Quasi-optimal \textit{hp}-finite element refinements towards singularities via deep neural network prediction, Clustering and outlier detection using isoperimetric number of trees, Min-max communities in graphs: complexity and computational properties, A novel graph-theoretical clustering approach to find a reduced set with extreme solutions of Pareto optimal solutions for multi-objective optimization problems, Graph clustering, A general view on computing communities, Finding large \(k\)-clubs in undirected graphs, Contracted Webgraphs: Structure Mining and Scale-Freeness, Linking temporal records, Automatically finding clusters in normalized cuts, Nash stability in additively separable hedonic games and community structures, Dynamic Graph Clustering Using Minimum-Cut Trees, Constrained overlapping clusters: minimizing the negative effects of bridge‐nodes, A framework for clustering massive graph streams, A general framework for efficient clustering of large datasets based on activity detection, Symmetric submodular system: contractions and Gomory-Hu tree, Distance preserving model order reduction of graph-Laplacians and cluster analysis, Experiments on Density-Constrained Graph Clustering, Approximation algorithms for a hierarchically structured bin packing problem, On the complexity of isoperimetric problems on trees, A note on the satisfactory partition problem: constant size requirement, Memetic Graph Clustering