Hi,

Can anyone give an hint as to what is the underlying problem for this graph problem?

https://icpcarchive.ecs.baylor.edu/external/64/6450.pdf

I think we need to sort the number of nodes by most edges and as we choose a node, ignore the nodes to which this selected node is connected to?

Any hints will be appreciated.

Thanks