An exact algorithm for maximum independent set in degree-5 graphs

The maximum independent set problem is a basic NP-hard problem and has been extensively studied in exact algorithms. The maximum independent set problems in low-degree graphs are also important and may be bottlenecks of the problem in general graphs. In this paper, we present an O∗

• Type: Journal
• Year: 2016
• Where: DAM
• Authors: Mingyu Xiao, Hiroshi Nagamochi
• Keywords: DAM 2016