May Long challenge (ADAPWN)


Anyone share their approach how to solve this question.
link -


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


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


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


@alei can you please explain your approach.


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


My bad man. Just wanted to help :v: