10 citations · 22 across the 8 of their papers we have counts for
1 paper · 2 filters
Adil Erzin, Roman Plotnikov, Georgii Zhukov
The paper considers the NP-hard graph vertex coloring problem, which differs from traditional problems in which it is required to color vertices with a given (or minimal) number of…