Experiments on Density-Constrained Graph Clustering

DOI10.1145/2638551zbMath1347.68310arXiv1112.2143OpenAlexW2058132652MaRDI QIDQ2828182

Robert Görke, Dorothea Wagner, Andrea Kappes, Andrea Schumm

Publication date: 24 October 2016

Published in: ACM Journal of Experimental Algorithmics, 2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1112.2143

zbMATH Keywords

quality measuresgraph clusteringexperimental evaluation

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Fast Quasi-Threshold Editing ⋮ Experiments on Density-Constrained Graph Clustering

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Experiments on Density-Constrained Graph Clustering
• Engineering Comparators for Graph Clusterings
• Expander graphs and their applications
• On clusterings
• Graph Clustering Via a Discrete Uncoupling Process
• Graph Clustering and Minimum Cut Trees
• Density-Constrained Graph Clustering
• Fast unfolding of communities in large networks
• Multilevel local search algorithms for modularity clustering
• Computational Science - ICCS 2004

This page was built for publication: Experiments on Density-Constrained Graph Clustering