Finding topological subgraphs is fixed-parameter tractable

Details Finding topological subgraphs is fixed-parameter tractable Finding topological subgraphs is fixed-parameter tractable

2010-11-08

arxiv.org/abs/1011.1827v1

Computer Science

Data Structures and Algorithms

Scientific paper

We show that for every fixed undirected graph $H$, there is a $O(|V(G)|^3)$ time algorithm that tests, given a graph $G$, if $G$ contains $H$ as a topological subgraph (that is, a subdivision of $H$ is subgraph of $G$). This shows that topological subgraph testing is fixed-parameter tractable, resolving a longstanding open question of Downey and Fellows from 1992. As a corollary, for every $H$ we obtain an $O(|V(G)|^3)$ time algorithm that tests if there is an immersion of $H$ into a given graph $G$. This answers another open question raised by Downey and Fellows in 1992.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-131462