Showing cs.DSShow all
2 papers · 1 filter
cs.DS2013
Graph Clustering with Surprise: Complexity and Exact Solutions
Tobias Fleck, Andrea Kappes, Dorothea Wagner
Clustering graphs based on a comparison of the number of links within clusters and the expected value of this quantity in a random graph has gained a lot of attention and popularit…
cs.DS2011
Experiments on Density-Constrained Graph Clustering
Robert Görke, Andrea Schumm, Dorothea Wagner
Clustering a graph means identifying internally dense subgraphs which are only sparsely interconnected. Formalizations of this notion lead to measures that quantify the quality of…