Graph Clustering with Surprise: Complexity and Exact Solutions

DOI10.1007/978-3-319-04298-5_20zbMath1432.68352arXiv1310.6019OpenAlexW1816590423MaRDI QIDQ2938102

Andrea Kappes, Dorothea Wagner, Tobias Fleck

Publication date: 13 January 2015

Published in: SOFSEM 2014: Theory and Practice of Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: Graph Clustering with Surprise: Complexity and Exact Solutions