May Long challenge (ADAPWN)


#1

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


#2

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.


#3

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


#4

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


#5

@alei can you please explain your approach.


#7

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


#8

My bad man. Just wanted to help :v: