scientific article; zbMATH DE number 7310079

zbMath1477.68123MaRDI QIDQ5150425

A. A. Navrotskaya, Victor Petrovich Il'ev

Publication date: 15 February 2021

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

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

zbMATH Keywords

NP-hard problempolynomial-time problemgraph approximation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

Graph clustering with a constraint on cluster sizes ⋮ Bounds for the clustering complexity in a graph clustering problem with clusters of bounded size ⋮ Unnamed Item ⋮ On a semi-superwized graph clustering problem

Cites Work

• Unnamed Item
• La reduction minimale d'un graphe à une reunion de cliques
• Computational complexity of the graph approximation problem
• Approximating Symmetric Relations by Equivalence Relations
• Paths, Trees, and Flowers

This page was built for publication: