Using critical sets to solve the maximum independent set problem

Authors:
Sergiy Butenko;Svyatoslav Trukhanov
Affiliations:
Department of Industrial and Systems Engineering, Texas A&M University, College Station, Texas, USA;Department of Industrial and Systems Engineering, Texas A&M University, College Station, Texas, USA
Venue:
Operations Research Letters
Year:
2007

Citing 5
Cited 0

Finding critical independent sets and critical vertex subsets are polynomial problems

SIAM Journal on Discrete Mathematics
On Finding Critical Independent and Vertex Sets

SIAM Journal on Discrete Mathematics
Combinatorial optimization

Combinatorial optimization
On maximum clique problems in very large graphs

External memory algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Quantified Score

Hi-index	0.00

Visualization

Abstract

A method that utilizes the polynomially solvable critical independent set problem for solving the maximum independent set problem on graphs with a nonempty critical independent set is developed. The effectiveness of the proposed approach on large graphs with large independence number is demonstrated through extensive numerical experiments.