Dynamic Graph Clustering Using Minimum-Cut Trees

DOI10.1007/978-3-642-03367-4_30zbMath1253.68262OpenAlexW1565924926MaRDI QIDQ5895108

Tanja Hartmann, Dorothea Wagner, Robert Görke

Publication date: 20 October 2009

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

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

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (3)

Mining preserving structures in a graph sequence ⋮ A novel graph-theoretical clustering approach to find a reduced set with extreme solutions of Pareto optimal solutions for multi-objective optimization problems ⋮ Contracted Webgraphs: Structure Mining and Scale-Freeness

Cites Work

• Network analysis. Methodological foundations.
• Very Simple Methods for All Pairs Network Flow Analysis
• On clusterings
• Multi-Terminal Network Flows
• Graph Clustering and Minimum Cut Trees
• Dynamic Graph Clustering Using Minimum-Cut Trees

This page was built for publication: Dynamic Graph Clustering Using Minimum-Cut Trees