A graph H is called a topological minor, also known as a homeomorphic subgraph, of a graph G if a graph subdivision of H is isomorphic to a subgraph of G. Every topological minor is also a graph minor, but the reverse is not necessarily true. The subgraph homeomorphism problem consists of finding a homeomorphic image of a pattern graph H in an input graph G.