Sciweavers

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

50

ICTCS
2007
Springer

favoriteEmaildiscussreport

236views Theoretical Computer Science» more ICTCS 2007»

Computing Minimum Directed Feedback Vertex Set in O(1.9977n)

14 years 5 months ago

Computing Minimum Directed Feedback Vertex Set in O(1.9977n)

Download www.cs.ucc.ie

Igor Razgon

Real-time Traffic

ICTCS 2007 | Theoretical Computer Science |

claim paper

Related Content

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

» A Cubic Kernel for Feedback Vertex Set

» Feedback vertex set on ATfree graphs

» Solving the feedback vertex set problem on undirected graphs

» On Finding Minimum Deadly Sets for Directed Networks

» The Generalized Deadlock Resolution Problem

» Algorithms for Implicit Hitting Set Problems

» Kernels for Feedback Arc Set In Tournaments

» On the Directed DegreePreserving Spanning Tree Problem

Post Info
More Details (n/a)

Added	08 Jun 2010
Updated	08 Jun 2010
Type	Conference
Year	2007
Where	ICTCS
Authors	Igor Razgon

Comments (0)