scientific article; zbMATH DE number 6180556

zbMath1269.05104MaRDI QIDQ5298943

Andreas Geyer-Schulz, Michael Ovelgönne

Publication date: 25 June 2013

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

graph clustering, ensemble learning

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Post-processing partitions to identify domains of modularity optimization ⋮ Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization ⋮ Efficient modularity density heuristics for large graphs ⋮ Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering ⋮ Memetic Graph Clustering