Clustering, community partition and disjoint spanning trees

DOI10.1145/1367064.1367075zbMath1445.68181OpenAlexW2074167246MaRDI QIDQ4962740

Cun-Quan Zhang, Yongbin Ou

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

zbMATH Keywords

clusteringhierarchical clusteringpolynomial algorithmdense subgraphspanning treescommunity partitiondynamic density

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

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

This page was built for publication: Clustering, community partition and disjoint spanning trees