Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Krpan, Aljaž"'
Given an undirected graph, the stable set problem asks to determine the cardinality of the largest subset of pairwise non-adjacent vertices. This value is called the stability number of the graph, and its computation is an NP-hard problem. In this pa
Externí odkaz:
http://arxiv.org/abs/2405.12845