Detecting induced star-like minors in polynomial time

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F12%3A10133351" target="_blank" >RIV/00216208:11320/12:10133351 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.jda.2012.11.002" target="_blank" >http://dx.doi.org/10.1016/j.jda.2012.11.002</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.jda.2012.11.002" target="_blank" >10.1016/j.jda.2012.11.002</a>

Result language
angličtina
Original language name
Detecting induced star-like minors in polynomial time
Original language description
The Induced Minor problem is to test whether a graph G contains a graph H as an induced minor, i.e., if G can be modified into H by a sequence of vertex deletions and edge con- tractions. When H is fixed, i.e., not part of the input, this problem is denoted H-Induced Minor. We provide polynomial-time algorithms for this problem in the case that the fixed target graph has a star-like structure. In particular, we show polynomial-time solvability for all forests H on at most seven vertices except for one such case.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Project
<a href="/en/project/1M0545" target="_blank" >1M0545: Institute for Theoretical Computer Science</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)