An improved FPT algorithm for Almost Forest Deletion problem

Almost Forest Deletion problem (AFD) is a generalization of the Feedback Vertex Set problem, which decides whether there exist at most k vertices in a given graph G whose removal from G results in an l-forest, where k and l are two given non-negative integers, and an l-forest is a graph which can be...

Full description

Bibliographic Details

Published in:	Information processing letters Vol. 136; pp. 30 - 36
Main Authors:	Lin, Mugang, Feng, Qilong, Wang, Jianxin, Chen, Jianer, Fu, Bin, Li, Wenjun
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.08.2018
Subjects:	Almost forest deletion Feedback vertex set Fixed-parameter algorithm Graph algorithms Iterative compression Iterative compression Almost forest deletion Graph algorithms Feedback vertex set Fixed-parameter algorithm
ISSN:	0020-0190, 1872-6119
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!