Note: On maximum independent sets in P5-free graphs

Authors:
Bert Randerath;Ingo Schiermeyer
Affiliations:
Institute of Communications Engineering, Cologne University of Applied Sciences, 50679 Köln, Germany;Institute for Discrete Mathematics and Algebra, TU Bergakademie Freiberg, 09596 Freiberg, Germany
Venue:
Discrete Applied Mathematics
Year:
2010

Citing 3
Cited 0

Exact algorithms for NP-hard problems: a survey

Combinatorial optimization - Eureka, you shrink!
Measure and conquer: a simple O(20.288n) independent set algorithm

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

The complexity status of the Maximum Independent Set Problem (MIS) for the family of P"5-free graphs is unknown. Although for many subclasses of P"5-free graphs MIS can be solved in polynomial time, only exponential time MIS-algorithms for general graphs are known so far. In this note we present the first algorithm to solve MIS for P"5-free graphs in subexponential time.