scientific article; zbMATH DE number 6793097

zbMath1372.05219MaRDI QIDQ5369785

Oleg Duginov, I. G. Kouznetsova

Publication date: 18 October 2017

Full work available at URL: http://doklady.belnauka.by/jour/article/view/157

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

zbMATH Keywords

computational complexitygraph classesclustering minimum biclique completion problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: