The complexity of the simultaneous cluster problem

DOI10.7155/JGAA.00313MaRDI QIDQ2871222zbMATH OpenOpenAlexFDO

Authors Zhentao Li, Manikandan Narayanan, Adrian Vetta

Publication date 22 January 2014

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/jgaa.00313

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Density-constrained graph clustering
• Cluster graph modification problems
• scientific article; zbMATH DE number 1953109
• Clustering with lower-bounded sizes. A general graph-theoretic framework
• Correlation clustering with a fixed number of clusters

Cited in

(11)

• On the complexity of some cluster analysis problems
• Graph clustering with surprise: complexity and exact solutions
• Computing an aggregate edge-weight function for clustering graphs with multiple edge types
• Clustering with internal connectedness
• scientific article; zbMATH DE number 6007853 (Why is no real title available?)
• scientific article; zbMATH DE number 3984569 (Why is no real title available?)
• scientific article; zbMATH DE number 2011857 (Why is no real title available?)
• Density-constrained graph clustering
• On clustering on graphs with multiple edge types
• On the parameterized complexity of s-club cluster deletion problems
• Sum-of-squares lower bounds for densest k-subgraph

This page was built for publication: The complexity of the simultaneous cluster problem

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