Jungles, bundles, and fixed parameter tractability

Details Jungles, bundles, and fixed parameter tractability Jungles, bundles, and fixed parameter tractability

2011-12-07

arxiv.org/abs/1112.1538v1

Computer Science

Data Structures and Algorithms

Scientific paper

We give a fixed-parameter tractable (FPT) approximation algorithm computing
the path-width of a tournament, and more generally, of a semi-complete graph.
Based on this result, we prove that topological containment and rooted
immersion problems are FPT on semi-complete graphs.

Affiliated with

Also associated with

No associations

Rating

Jungles, bundles, and fixed parameter tractability 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 Jungles, bundles, and fixed parameter tractability, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Jungles, bundles, and fixed parameter tractability will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-595298