A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Approximating the maximum clique minor and some subgraph homeomorphism problems

2007
*
Theoretical Computer Science
*

We consider the "minor" and "homeomorphic" analogues of the maximum clique problem, i.e., the problems of determining the largest h such that the input graph (on n vertices) has a minor isomorphic to K h or a subgraph homeomorphic to K h , respectively, as well as the problem of finding the corresponding subgraphs. We term them as the maximum clique minor problem and the maximum homeomorphic clique problem, respectively. We observe that a known result of Kostochka and Thomason supplies an O( √

doi:10.1016/j.tcs.2006.12.021
fatcat:xieuhlle2ja7hea3pczirn4sfq