ON GENERIC COMPLEXITY OF THE GRAPH CLUSTERING PROBLEM

DOI10.17223/20710410/46/6zbMath1458.68073OpenAlexW3004276657MaRDI QIDQ5151290

Alexander N. Rybalov

Publication date: 17 February 2021

Published in: Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)

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

zbMATH Keywords

graph clusteringgeneric complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Unnamed Item ⋮ The generic complexity of the bounded problem of graphs clustering ⋮ The generic complexity of the graph triangulation problem

Cites Work

• 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 GENERIC COMPLEXITY OF THE VALIDITY PROBLEM FOR BOOLEAN FORMULAS
• On a semi-superwized graph clustering problem
• Unnamed Item
• Unnamed Item

This page was built for publication: ON GENERIC COMPLEXITY OF THE GRAPH CLUSTERING PROBLEM