On the Complexity of Reconstructing H-Free Graphs from Their Star Systems

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F11%3A10103380" target="_blank" >RIV/00216208:11320/11:10103380 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1002/jgt.20544" target="_blank" >http://dx.doi.org/10.1002/jgt.20544</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1002/jgt.20544" target="_blank" >10.1002/jgt.20544</a>

Result language
angličtina
Original language name
On the Complexity of Reconstructing H-Free Graphs from Their Star Systems
Original language description
We study the computational complexity of the H-free Star System problem. We prove that when H is a path or a cycle on at most four vertices the problem is polynomial time solvable. In complement to this result, we show that if H belongs to a certain large class of graphs the H-free Star System problem is NP-complete. In particular, the problem is NP-complete when H is either a cycle or a path on at least five vertices. This yields a complete dichotomy for paths and cycles.
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)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

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

Similar results(10)