On generic complexity of the graph clustering problem with bounded clusters

DOI10.17223/20710410/60/10MaRDI QIDQ6081726zbMATH OpenFDO

Authors Alexander Rybalov

Publication date 5 October 2023

Full work available at URL http://mathnet.ru/eng/pdm807

zbMATH Keywords

graph clusteringgeneric complexity

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• The generic complexity of the bounded problem of graphs clustering
• ON GENERIC COMPLEXITY OF THE GRAPH CLUSTERING PROBLEM
• scientific article; zbMATH DE number 7746258
• The generic complexity of the graph triangulation problem
• THE GENERAL COMPLEXITY OF THE PROBLEM TO RECOGNIZE HAMILTONIAN PATHS

Cites work

• scientific article; zbMATH DE number 3664741 (Why is no real title available?)
• scientific article; zbMATH DE number 1559537 (Why is no real title available?)
• Cluster graph modification problems
• Computational complexity of the graph approximation problem
• Computational complexity of the problem of approximation by graphs with connected components of bounded size
• Correlation clustering
• Generic-case complexity, decision problems in group theory, and random walks.
• NP-hard problems in hierarchical-tree clustering
• ON GENERIC COMPLEXITY OF THE GRAPH CLUSTERING PROBLEM
• On a semi-supervised graph clustering problem
• The generic complexity of the bounded problem of graphs clustering

Cited in

(4)

• Limitations on regularity lemmas for clustering graphs
• On the Complexity of Clustering with Relaxed Size Constraints
• ON GENERIC COMPLEXITY OF THE GRAPH CLUSTERING PROBLEM
• SOFSEM 2006: Theory and Practice of Computer Science

This page was built for publication: On generic complexity of the graph clustering problem with bounded clusters

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