2017年10月
A refined algorithm for maximum independent set in degree-4 graphs
JOURNAL OF COMBINATORIAL OPTIMIZATION
- ,
- 巻
- 34
- 号
- 3
- 開始ページ
- 830
- 終了ページ
- 873
- 記述言語
- 英語
- 掲載種別
- 研究論文(学術雑誌)
- DOI
- 10.1007/s10878-017-0115-3
- 出版者・発行元
- SPRINGER
The maximum independent set problem is one of the most important problems in theoretical analysis on time and space complexities of exact algorithms. Theoretical improvement on upper bounds on time complexity to solve this problem in low-degree graphs can lead to an improvement on that to the problem in general graphs. In this paper, we derive an upper bound on the time complexity of a polynomial-space algorithm that solves the maximum independent set problem in an n-vertex graph with degree bounded by 4, improving all previous upper bounds on the time complexity of exact algorithms to this problem. Our algorithm is a branch-and-reduce algorithm and analyzed by using the measure-and-conquer method. To make an amortized analysis of the running time bound, we use an idea of "shift" to save some decrease of the measure from good branches to bad branches. Our algorithm first deals with small vertex cuts and vertices of degree , which may be created in our algorithm even if the input graph has maximum degree 4, then eliminates cycles of length 3 and 4 containing degree-4 vertices, and finally branches on degree-4 vertices. We invoke an exact algorithm for this problem in graphs with maximum degree 3 directly when the graph has no vertices of degree . Branching on degree-4 vertices on special local structures will be the bottleneck case, and we carefully design rules of choosing degree-4 vertices to branch on so that the resulting instances after branching decrease the measure effectively in the next step.
- リンク情報
- ID情報
-
- DOI : 10.1007/s10878-017-0115-3
- ISSN : 1382-6905
- eISSN : 1573-2886
- Web of Science ID : WOS:000411586300014