Feedback Vertex Set in Mixed Graphs

Details Feedback Vertex Set in Mixed Graphs Feedback Vertex Set in Mixed Graphs

2010-10-28

arxiv.org/abs/1010.5974v1

Computer Science

Data Structures and Algorithms

Scientific paper

A mixed graph is a graph with both directed and undirected edges. We present
an algorithm for deciding whether a given mixed graph on $n$ vertices contains
a feedback vertex set (FVS) of size at most $k$, in time $2^{O(k)}k! O(n^4)$.
This is the first fixed parameter tractable algorithm for FVS that applies to
both directed and undirected graphs.

Affiliated with

Also associated with

No associations

Rating

Feedback Vertex Set in Mixed Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Feedback Vertex Set in Mixed Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Feedback Vertex Set in Mixed Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-584007