Subexponential-Time Algorithms for Maximum Independent Set in P t -Free and Broom-Free Graphs

In algorithmic graph theory, a classic open question is to determine the complexity of the Maximum Independent Set problem on Pt-free graphs, that is, on graphs not containing any induced path on t vertices. So far, polynomial-time algorithms are known only for t≤5 (Lokshtanov et al., in: Proceeding...

Full description

Bibliographic Details

Published in:	Algorithmica Vol. 81; no. 2; pp. 421 - 438
Main Authors:	Bacsó, Gábor, Lokshtanov, Daniel, Marx, Dániel, Pilipczuk, Marcin, Tuza, Zsolt, van Leeuwen, Erik Jan
Format:	Journal Article
Language:	English
Published:	New York Springer Nature B.V 15.02.2019
Subjects:	Algorithms Apexes Graph theory Graphs Polynomials Run time (computers) Weight
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!