Fully-dynamic hierarchical graph clustering using cut trees

DOI10.1007/978-3-642-22300-6_29MaRDI QIDQ5199255zbMATH OpenOpenAlexFDO

Authors Christof Doll, Tanja Hartmann, Dorothea Wagner

Publication date 12 August 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://publikationen.bibliothek.kit.edu/1000022450/1978017

Mathematics Subject Classification ID

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

Recommendations

• Dynamic graph clustering using minimum-cut trees
• Dynamic Graph Clustering Using Minimum-Cut Trees
• Graph Clustering and Minimum Cut Trees
• Complete hierarchical cut-clustering: a case study on expansion and modularity
• Dynamic graph clustering combining modularity and smoothness

Cited in

(4)

• Dynamic Graph Clustering Using Minimum-Cut Trees
• Dynamic graph clustering using minimum-cut trees
• Symmetric submodular system: contractions and Gomory-Hu tree
• Complete hierarchical cut-clustering: a case study on expansion and modularity

This page was built for publication: Fully-dynamic hierarchical graph clustering using cut trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5199255)