Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2014

Highly Cited

2014

We present a new deterministic algorithm for the Feedback Vertex Set problem parameterized by the solution size. Our algorithm… Expand

Highly Cited

2010

Highly Cited

2010

We prove that given an undirected graph <i>G</i> on <i>n</i> vertices and an integer <i>k</i>, one can compute, in polynomial… Expand

Highly Cited

2008

Highly Cited

2008

The (parameterized) FEEDBACK VERTEX SET problem on directed graphs (i.e., the DFVS problem) is defined as follows: given a… Expand

Highly Cited

2007

Highly Cited

2007

We present improved parameterized algorithms for the Feedback Vertex Set problem on both unweighted and weighted graphs. Both… Expand

Highly Cited

2006

Highly Cited

2006

We show that the NP-complete Feedback Vertex Set problem, which asks for the smallest set of vertices to remove from a graph to… Expand

Highly Cited

2000

Highly Cited

2000

We obtain a necessary and sufficient condition in terms of forbidden structures for tournaments to possess the min-max relation… Expand

Highly Cited

2000

Highly Cited

2000

Abstract Given a graph G=(V,E) , the minimum feedback vertex set V is a subset of vertices of minimum size whose removal induces… Expand

Highly Cited

1999

Highly Cited

1999

A feedback vertex set of a graph is a subset of vertices that contains at least one vertex from every cycle in the graph. The… Expand

Highly Cited

1998

Highly Cited

1998

Abstract. This paper deals with approximating feedback sets in directed graphs. We consider two related problems: the weighted… Expand

Highly Cited

1998

Highly Cited

1998

A feedback vertex set of an undirected graph is a subset of vertices that intersects with the vertex set of each cycle in the… Expand