Density-constrained graph clustering

DOI10.1007/978-3-642-22300-6_58MaRDI QIDQ5199283zbMATH OpenOpenAlexFDO

Authors Robert Görke, Andrea Schumm, Dorothea Wagner

Publication date 12 August 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://publikationen.bibliothek.kit.edu/1000023084

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• On Finding Graph Clusterings with Maximum Modularity
• The complexity of the simultaneous cluster problem
• On clusterings: good, bad and spectral

Cited in

(9)

• Coherent network partitions
• Lower bounds on paraclique density
• Local search for constrained graph clustering in biological networks
• The complexity of the simultaneous cluster problem
• Graph clustering with surprise: complexity and exact solutions
• Graph clustering via intra-cluster density maximization
• Testability of minimum balanced multiway cut densities
• Graph Clustering using Effective Resistance
• Metric-Constrained Optimization for Graph Clustering Algorithms

This page was built for publication: Density-constrained graph clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5199283)