Finding topological subgraphs is fixed-parameter tractable

@inproceedings{Grohe2010FindingTS,
  title={Finding topological subgraphs is fixed-parameter tractable},
  author={Martin Grohe and Ken-ichi Kawarabayashi and D{\'a}niel Marx and Paul Wollan},
  booktitle={STOC '11},
  year={2010}
}
  • Martin Grohe, Ken-ichi Kawarabayashi, +1 author Paul Wollan
  • Published in STOC '11 2010
  • Mathematics, Computer Science
  • We prove that for every fixed undirected graph <i>H</i>, there is an O(|V(G)|<sup>3</sup>) time algorithm that, given a graph <i>G</i>, tests if <i>G</i> contains <i>H</i> as a topological subgraph (that is, a subdivision of <i>H</i> is subgraph of <i>G</i>). 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 <i>H</i> we obtain an O(|V(G)|<sup>3</sup>) time algorithm that… CONTINUE READING

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 88 CITATIONS, ESTIMATED 73% COVERAGE

    Minimum bisection is fixed parameter tractable

    VIEW 2 EXCERPTS
    CITES BACKGROUND & METHODS

    Hitting topological minors is FPT

    VIEW 5 EXCERPTS
    HIGHLY INFLUENCED

    Testing subdivision-freeness: property testing meets structural graph theory

    VIEW 2 EXCERPTS
    CITES RESULTS & BACKGROUND

    A stronger structure theorem for excluded topological minors

    VIEW 1 EXCERPT
    CITES BACKGROUND

    FILTER CITATIONS BY YEAR

    2009
    2020

    CITATION STATISTICS

    • 6 Highly Influenced Citations

    • Averaged 10 Citations per year from 2018 through 2020

    References

    Publications referenced by this paper.
    SHOWING 1-3 OF 3 REFERENCES

    The Directed Subgraph Homeomorphism Problem

    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL

    Fixed-parameter intractability

    VIEW 8 EXCERPTS
    HIGHLY INFLUENTIAL

    Parameterized Complexity

    VIEW 8 EXCERPTS
    HIGHLY INFLUENTIAL