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

Saved in:

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:	01.02.2019
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
ISSN:	0178-4617 1432-0541
DOI:	10.1007/s00453-018-0479-5