4 citations · 4 across the 5 of their papers we have counts for
1 paper · 1 filter
Alexis Langlois-Rémillard, Mia Müßig
Finding a set of vertices in a graph with no edges between them, INDSET, is a well-known NP-complete problem. The queen graph of a chessboard is constructed by taking vertices as t…