An improved FPT algorithm for Almost Forest Deletion problem
Authors:
- Mugang LinMLMugang Lin
- Qilong FengQFQilong Feng
- Jianxin WangJWJianxin Wang
- Jianer ChenJCJianer Chen
- Bin FuBFBin Fu
- Wenjun LiWLWenjun Li
- 1 August 2018
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 136, 30-36
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (61472449, 61772179, 61420106009, 61402054, 61572414, 71631008)
- Scientific Research Fund of Hunan Provincial Education Department (17C0222)
- Hengyang Foundation for Development of Science and Technology (2016KG39)
- Science and Technology Plan Project of Hunan Province (2016TP1020)
- Open Fund Project of Hunan Provincial Key Laboratory of Intelligent Information Processing and Application for Hengyang Normal University
This publication has 22 references indexed in Scilit:
- Subset Feedback Vertex Set Is Fixed-Parameter TractableSIAM Journal on Discrete Mathematics, 2013
- On Parameterized Independent Feedback Vertex SetTheoretical Computer Science, 2012
- Parameterized computational complexity of Dodgson and Young electionsInformation and Computation, 2010
- Improved algorithms for feedback vertex set problemsJournal of Computer and System Sciences, 2008
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartizationJournal of Computer and System Sciences, 2006
- Finding odd cycle transversalsOperations Research Letters, 2004
- Fixed-parameter complexity in AI and nonmonotonic reasoningArtificial Intelligence, 2002
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set ProblemSIAM Journal on Discrete Mathematics, 1999
- Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problemArtificial Intelligence, 1996
- An exact algorithm for selecting partial scan flip-flopsJournal of Electronic Testing, 1995