Abstract

An algorithm is presented for finding a maximum independent set in a connected graph with n vertices and m edges in time O(poly(n)1.2365m−n). As a consequence, we find a maximum independent set in a graph of degree 3 in time O(poly(n)1.1120n), which improves the currently best results of O(1.1254n) of Chen, Kanj and Xia.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call