scientific article; zbMATH DE number 7746262

DOI10.17223/20710410/60/10MaRDI QIDQ6081726

Alexander N. Rybalov

Publication date: 5 October 2023

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

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

zbMATH Keywords

graph clusteringgeneric complexity

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Correlation clustering
• NP-hard problems in hierarchical-tree clustering
• Generic-case complexity, decision problems in group theory, and random walks.
• Cluster graph modification problems
• Computational complexity of the graph approximation problem
• On a semi-superwized graph clustering problem
• ON GENERIC COMPLEXITY OF THE GRAPH CLUSTERING PROBLEM
• The generic complexity of the bounded problem of graphs clustering

This page was built for publication: