May Long challenge (ADAPWN)

Anyone share their approach how to solve this question.
link - https://www.codechef.com/MAY19A/problems/ADAPWN

1 Like

A search for “A refined algorithm for maximum independent set in degree-4 graphs” on https://sci-hub.tw/ gives you a very detailed paper handling this problem.

Unfortunatly that link is unusable without installing the proper chrome extension.

1 Like

not need of that fancy stuff, since the graph is bipartite.

2 Likes

@alei can you please explain your approach.

LOL @shoryaj I am talking about the problem (ADAPAWN) not (ADAROKS2).

1 Like

My bad man. Just wanted to help :v:

1 Like