In this case the graph is /font>-regular (all vertices have the same ... using a greedy heuristic for a generalisation of the maximum independent set prob-.
確定! 回上一頁