Exact algorithms for maximum independent set

@article{Xiao2017ExactAF,
  title={Exact algorithms for maximum independent set},
  author={Mingyu Xiao and Hiroshi Nagamochi},
  journal={ArXiv},
  year={2017},
  volume={abs/1312.6260}
}
Abstract We show that the maximum independent set problem on an n-vertex graph can be solved in 1.1996 n n O ( 1 ) time and polynomial space, which even is faster than Robson's 1.2109 n n O ( 1 ) -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.1893 n n O ( 1 ) and 1.1970 n n O ( 1 ) , respectively. Our algorithms are obtained by using fast algorithms for MIS in low-degree graphs in a… Expand
Exact algorithms for maximum weighted independent set on sparse graphs
  • Sen Huang, Mingyu Xiao, Xiaoyu Chen
  • Computer Science
  • ArXiv
  • 2021
TLDR
This paper designs several reduction rules and a fast exact algorithm for the maximum weighted independent set problem, and uses the measure-and-conquer technique to analyze the running time bound of the algorithm. Expand
Exact algorithms for Maximum Induced Matching
This paper studies exact algorithms for the Maximum Induced Matching problem, in which an n-vertex graph is given and we are asked to find a set of maximum number of edges in the graph such that noExpand
Faster exact algorithms for some terminal set problems
TLDR
This paper introduces a general method to obtain faster exact exponential time algorithms for several terminal set problems, and breaks the O⁎(2n) barrier for the classic Node Multiway Cut, Directed Unrestricted Node Multi way Cut and Directed Subset Feedback Vertex Set problems. Expand
Dynamic Near Maximum Independent Set with Time Independent of Graph Size
TLDR
A framework based on swap operations for resolving the problem to maintain a high-quality independent set, which is an approximation of the MaxIS, over dynamic graphs is presented and two concrete update algorithms based on one- Swappable vertices and two-swappble vertex pairs are designed. Expand
The Generalized Independent and Dominating Set Problems on Unit Disk Graphs
TLDR
A generalized version of the maximum independent set and minimum dominating set problems, namely, the maximum $d-distance independent set problem and the minimum $d$-distance dominating set problem on unit disk graphs for a positive integer $d>0$. Expand
Improved Branching Strategies for Maximum Independent Sets
The NP-complete graph problem maximum independent set is that of finding a set of pairwise non adjacent vertices of largest cardinality [14]. Applications of this problem span multiple real-worldExpand
Efficient Reductions and a Fast Algorithm of Maximum Weighted Independent Set
TLDR
The structural properties of the maximum independent set problem are studied, giving some sufficient conditions for a vertex being or not being in a maximum weighted independent set, providing a suite of reduction rules that includes and generalizes almost all frequently used reduction rules for this problem. Expand
Moderately exponential time algorithms for the maximum bounded-degree-1 set problem
TLDR
A simple branch- and-reduce algorithm running in polynomial space and applying branching strategies with at most three branches for Max 1-bds is given and the running time is analyzed using measure-and-conquer and shows that it runs in time O ∗ ( 1 . 461 3 n ) which is faster than previous exact algorithms. Expand
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs
TLDR
This work is able to show that the VertexCover problem on hyperbolic random graphs can be solved in polynomial time, with high probability, and relies on interesting structural properties of hyperbolics random graphs. Expand
A note on the fine-grained complexity of MIS on regular graphs
TLDR
It is shown that there is no subexponential time algorithm for computing the exact solution of the maximum independent set problem in d-regular graphs, unless ETH fails, and the construction is utilized to show the NP-hardness of MIS on 5-regular planar graphs, closing the exact complexity status of the problem on regular planar graph. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 36 REFERENCES
An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs
TLDR
This paper introduces an effective divide-and-conquer procedure to deal with vertex cuts of size at most two in graphs, and design branching rules on some special structure of triconnected graphs of maximum degree 5 that result in an improved algorithm without introducing a large number of branching rules. Expand
Algorithms for Maximum Independent Sets
  • J. Robson
  • Mathematics, Computer Science
  • J. Algorithms
  • 1986
Abstract An algorithm is presented which finds (the size of) a maximum independent set of an n vertex graph in time O (2 0.276 n ) improving on a previous bound of O(2 n 3 ) . The improvement comesExpand
Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3
  • I. Razgon
  • Computer Science, Mathematics
  • J. Discrete Algorithms
  • 2009
TLDR
The presented results have a methodological interest because, to the best of the authors' knowledge, this is the first time when a new parameterized upper bound is obtained through design and analysis of an exact exponential algorithm. Expand
A refined algorithm for maximum independent set in degree-4 graphs
TLDR
An upper bound is derived 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 theTime complexity of exact algorithms to this problem. Expand
A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs
TLDR
An algorithm is presented and a maximum independent set is found 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. Expand
Finding maximum independent sets in sparse and general graphs
  • R. Beigel
  • Mathematics, Computer Science
  • SODA '99
  • 1999
TLDR
The fastest MIS algorithms for sparse graphs and for graphs whose degree is bounded by 3 or by 4 are obtained, and the fastest MIS algorithm for bounded-degree graphs is obtained. Expand
A Simple and Fast Algorithm for Maximum Independent Set in 3-Degree Graphs
TLDR
This paper uses a nontraditional measure to analyze the problem size and some uniform branching rules to avoid tedious case analysis and presents a simple O*(1.0885n)-time algorithm for finding a maximum independent set in an n-vertex graph with degree bounded by 3. Expand
Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs
We present an O^*(1.0836^n)-time algorithm for finding a maximum independent set in an n-vertex graph with degree bounded by 3, which improves all previous running time bounds for this problem. OurExpand
Fast Algorithms for max independent set
TLDR
This work proposes a method that “propagates” improvement of the worst-case complexity for “sparse” instances to “denser” ones and shows an easy though non-trivial application of it to the min set cover problem. Expand
Improved upper bounds for vertex cover
TLDR
Several new techniques, as well as generalizations of previous techniques, are introduced including: general folding, struction, tuples, and local amortized analysis in the polynomial-space algorithm for Vertex Cover. Expand
...
1
2
3
4
...