1 paper
Vyacheslav Moklev, Vladimir Ulyantsev
There are numerous NP-hard combinatorial problems which involve searching for an undirected graph satisfying a certain property. One way to solve such problems is to translate a pr…