Graph Clustering and Minimum Cut Trees
From MaRDI portal
Publication:4672747
DOI10.1080/15427951.2004.10129093zbMath1098.68095MaRDI 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
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
Related Items
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, Unnamed Item, Memetic Graph Clustering, Dynamic Graph Clustering Using Minimum-Cut Trees, Quasi-optimal \textit{hp}-finite element refinements towards singularities via deep neural network prediction, 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, Automatically finding clusters in normalized cuts, Nash stability in additively separable hedonic games and community structures, On the complexity of isoperimetric problems on trees, Clustering and outlier detection using isoperimetric number of trees, Min-max communities in graphs: complexity and computational properties, Approximation algorithms for a hierarchically structured bin packing problem, Linking temporal records, Distance preserving model order reduction of graph-Laplacians and cluster analysis, A note on the satisfactory partition problem: constant size requirement, Symmetric submodular system: contractions and Gomory-Hu tree, Online summarization of dynamic graphs using subjective interestingness for sequential data, Experiments on Density-Constrained Graph Clustering, Contracted Webgraphs: Structure Mining and Scale-Freeness