You are preparing a banquet where the guests are government ofﬁcials from many different countries. In order to avoid unnecessary troubles, you are asked to check the list of international conﬂicts in the last ten years. Then, you will assign the guests to two tables, such that in each table, any two guests are not from countries that had conﬂicts in the last ten years.
Provide an efﬁcient algorithm that determines whether it is possible to make such an assignment. If it is possible to do so, the algorithm should return the assignment of these two tables. What is the running time?
so I guess it asks here that a country can have conflicts with multiple countries and any two guests in the same table should not come from countries that had conflicts in the last ten years.
So lets say there are X number of people in the table then X-2 have conflicts with each other?
Also what algorithm would I use for this, can someone please help me out.