NobleBlocks

Research indexJournal article

Редукция графа при поиске реберного покрытия минимальным числом клик

Ролдугин, Ролдугин

Математические вопросы криптографии1 Jan 2012Open access

NobleIDark:/48914/w1/20260515/0941CD48DOI10.4213/mvk63

Abstract

The problem of construction of a graph coverage with a minimum number of its complete subgraphs (cliques) is considered. We describe classes of subgraphs for which it is possible to reduce the graph coverage problem to the same problem for graphs of smaller orders. We show that these classes are wider than those known before.

Discussion

Citations

Topics

More

Suggest a correction or report