Clustering, community partition and disjoint spanning trees
From MaRDI portal
Publication:4962740
DOI10.1145/1367064.1367075zbMath1445.68181MaRDI QIDQ4962740
Publication date: 5 November 2018
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1367064.1367075
clustering; hierarchical clustering; polynomial algorithm; dense subgraph; spanning trees; community partition; dynamic density
62H30: Classification and discrimination; cluster analysis (statistical aspects)
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Flows and parity subgraphs of graphs with large odd-edge-connectivity, Edge-disjoint spanning trees and the number of maximum state circles of a graph