Exact algorithms for maximum independent set

We show that the maximum independent set problem on an n-vertex graph can be solved in 1.1996nnO(1) time and polynomial space, which even is faster than Robson's 1.2109nnO(1)-time exponential-space algorithm published in 1986. We also obtain improved algorithms for MIS in graphs with maximum de...

Full description

Bibliographic Details

Published in:	Information and computation Vol. 255; pp. 126 - 146
Main Authors:	Xiao, Mingyu, Nagamochi, Hiroshi
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.08.2017
Subjects:	Amortized analysis Branch-and-reduce Exact algorithm Graph Independent set Measure-and-conquer Polynomial-space Graph Amortized analysis Independent set Measure-and-conquer Exact algorithm Branch-and-reduce Polynomial-space
ISSN:	0890-5401, 1090-2651
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!