How to solve this graph problem?

Revision en1, by ajecc, 2017-07-12 17:23:12

You are given a graph and a number k. Output the biggest set of nodes such as every node has at least k adjacent nodes that are also in the set. (The solution should have a better complexity than O(n^2), n = number of nodes) Thanks!

Tags #graph

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English ajecc 2017-07-12 17:23:12 265 Initial revision (published)