An exact algorithm for maximum independent set in degree-5 graphs
نویسندگان
چکیده
منابع مشابه
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∗(1.1737n)-time exact algorithm for the maximum independent set problem in an n-vertex graph with degree bounded by ...
متن کاملAn Optimal Algorithm to Find Maximum Independent Set and Maximum 2-Independent Set on Cactus Graphs
A cactus graph is a connected graph in which every block is either an edge or a cycle. An optimal algorithm is presented here to find a maximum independent set and maximum 2-independent set on cactus graphs in O(n) time, where n is the total number of vertices of the graph. The cactus graph has many applications in real life problems, specially in radio communication system.
متن کاملFurther Improvement on Maximum Independent Set in Degree-4 Graphs
We present a simple algorithm for the maximum independent set problem in an n-vertex graph with degree bounded by 4, which runs in O∗(1.1455n) time and improves all previous algorithms for this problem. In this paper, we use the “Measure and Conquer method” to analyze the running time bound, and use some good reduction and branching rules with a new idea on setting weights to obtain the improve...
متن کاملA refined algorithm for maximum independent set in degree-4 graphs
The maximum independent set problem is one of the most important problems in worstcase analysis for exact algorithms. Improvement on this problem in low-degree graphs can be used to get improvement on the problem in general graphs. In this paper, we show that the maximum independent set problem in an n-vertex graph with degree bounded by 4 can be solved in O∗(1.1376n) time and polynomial space,...
متن کاملExact Algorithms for Maximum Independent Set
We show that the maximum independent set problem (MIS) on an n-vertex graph can be solved in 1.1996n time and polynomial space, which even is faster than Robson’s 1.2109n-time exponential-space algorithm published in 1986. We also obtain improved algorithms for MIS in graphs with maximum degree 6 and 7, which run in time of 1.1893n and 1.1970n, respectively. Our algorithms are obtained by using...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2016
ISSN: 0166-218X
DOI: 10.1016/j.dam.2014.07.009