Exact algorithms for maximum independent set

DOI10.1016/J.IC.2017.06.001MaRDI QIDQ2013558zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Mingyu Xiao, Hiroshi Nagamochi

Publication date 8 August 2017

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1312.6260

zbMATH Keywords

graphexact algorithmmeasure-and-conquerindependent setamortized analysisbranch-and-reducepolynomial-space

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Abstract: We show that the maximum independent set problem (MIS) 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 hierarchical way and making a careful analyses on the structure of bounded-degree graphs.

Recommendations

• Exact Algorithms for Maximum Independent Set
• scientific article; zbMATH DE number 1305487
• A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs
• Fast algorithms for max independent set
• An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs

Cites work

• scientific article; zbMATH DE number 1305487 (Why is no real title available?)
• scientific article; zbMATH DE number 1953201 (Why is no real title available?)
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs
• A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances
• A fine-grained analysis of a simple independent set algorithm
• A measure \& conquer approach for the analysis of exact algorithms
• A refined algorithm for maximum independent set in degree-4 graphs
• A simple and fast algorithm for Maximum Independent Set in 3-degree graphs (extended abstract)
• Algorithms for maximum independent sets
• An O(2^0.304n) Algorithm for Solving Maximum Independent Set Problem
• An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
• An exact algorithm for maximum independent set in degree-5 graphs
• Confining sets and avoiding bottleneck cases: a simple maximum independent set algorithm in degree-3 graphs
• Exact Algorithms for Maximum Independent Set
• Exact exponential algorithms.
• Fast algorithms for max independent set
• Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3
• Finding a Maximum Independent Set
• Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms
• Vertex cover: Further observations and further improvements

Cited in

(47)

• Further improvements for SAT in terms of formula length
• An O(2^0.304n) Algorithm for Solving Maximum Independent Set Problem
• scientific article; zbMATH DE number 1305522 (Why is no real title available?)
• Conflict free version of covering problems on graphs: classical and parameterized
• An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs
• Exact algorithms for restricted subset feedback vertex set in chordal and split graphs
• On kernels for \(d\)-path vertex cover
• Average-case complexity of a branch-and-bound algorithm for \textsc{Min Dominating Set}
• A bisection approach to subcubic maximum induced matching
• Exact Solution Algorithms for the Chordless Cycle Problem
• On the maximal independence polynomial of the covering graph of the hypercube up to \(n=6\)
• A polytime preprocess algorithm for the maximum independent set problem
• Faster exponential-time algorithms for approximately counting independent sets
• Algorithms for maximum independent sets
• Moderately exponential time algorithms for the maximum bounded-degree-1 set problem
• Exact and parameterized algorithms for restricted subset feedback vertex set in chordal graphs
• Exact Algorithms for Maximum Independent Set
• A refined algorithm for maximum independent set in degree-4 graphs
• An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem†
• Exact algorithms for maximum induced matching
• \textit{Branch} \& \textit{memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees
• A note on the fine-grained complexity of MIS on regular graphs
• A bottom-up method and fast algorithms for Max Independent Set
• Exact algorithms for maximum weighted independent set on sparse graphs (extended abstract)
• Domination chain: characterisation, classical complexity, parameterised complexity and approximability
• A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees
• Reinforcement learning for combinatorial optimization: a survey
• An exact algorithm for maximum independent set in degree-5 graphs
• On comparing algorithms for the maximum clique problem
• A fine-grained analysis of a simple independent set algorithm
• Minimum number of maximal dissociation sets in trees
• Listing Maximal Independent Sets with Minimal Space and Bounded Delay
• Four Shorts Stories on Surprising Algorithmic Uses of Treewidth
• Fast local search for the maximum independent set problem
• Fast algorithms for max independent set
• Maximum Weighted Independent Set: Effective Reductions and Fast Algorithms on Sparse Graphs
• Exact algorithms for counting 3-colorings of graphs
• Targeted Branching for the Maximum Independent Set Problem
• Generating Faster Algorithms for d-Path Vertex Cover
• Turán’s Theorem Through Algorithmic Lens
• An O *(1.0977 n ) Exact Algorithm for max independent set in Sparse Graphs
• Approximation algorithms for maximum independent set of pseudo-disks
• Faster FPT algorithm for 5-path vertex cover
• Solving vertex cover in polynomial time on hyperbolic random graphs
• Confining sets and avoiding bottleneck cases: a simple maximum independent set algorithm in degree-3 graphs
• On the complexity of detecting hazards
• Moderate exponential-time algorithms for scheduling problems

This page was built for publication: Exact algorithms for maximum independent set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2013558)