Bounded Size Graph Clustering with Applications to Stream Processing

DOI10.4230/LIPIcs.FSTTCS.2009.2325zbMath1248.68219OpenAlexW2288434581MaRDI QIDQ2920135

Joel L. Wolf, Deepak Rajan, Kirsten Hildrum, Sujay Parekh, Rohit Khandekar, Jay Sethuraman

Publication date: 24 October 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_c5e9.html

zbMATH Keywords

graph partitioninguncrossingsymmetric submodular functionsGomory-Hu trees

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (1)

Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds

This page was built for publication: Bounded Size Graph Clustering with Applications to Stream Processing