Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

DAGSTUHL
2007

favoriteEmaildiscussreport

162views Software Engineering» more DAGSTUHL 2007»

Directed Feedback Vertex Set Problem is FPT

13 years 6 months ago

Directed Feedback Vertex Set Problem is FPT

Download drops.dagstuhl.de

To decide if the parameterized feedback vertex set problem in directed graph is ﬁxed-parameter tractable is a long standing open problem. In this paper, we prove that the parameterized feedback vertex set in directed graph is ﬁxed-parameter tractable and

Jianer Chen, Yang Liu 0002, Songjian Lu

Real-time Traffic

DAGSTUHL 2007 | Feedback Vertex Set | Parameterized Feedback Vertex | Software Engineering | Vertex Set Problem |

claim paper

Related Content

» Experimental Study of FPT Algorithms for the Directed Feedback Vertex Set Problem

» A Cubic Kernel for Feedback Vertex Set

» Coordinatized Kernels and Catalytic Reductions An Improved FPT Algorithm for Max Leaf Span...

» Querying Graphs in ProteinProtein Interactions Networks Using Feedback Vertex Set

» FPT Algorithms for Connected Feedback Vertex Set

» A fixedparameter algorithm for the directed feedback vertex set problem

» FPT algorithms and kernels for the Directed kLeaf problem

» A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem

» Multiple Hypernode Hitting Sets and Smallest TwoCores with Targets

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2007
Where	DAGSTUHL
Authors	Jianer Chen, Yang Liu 0002, Songjian Lu

Comments (0)