RECOGNISING THE OVERLAP GRAPHS OF SUBTREES OF RESTRICTED TREES IS HARD
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F19%3A10406122" target="_blank" >RIV/00216208:11320/19:10406122 - isvavai.cz</a>
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=oQ0edLnR1F" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=oQ0edLnR1F</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
RECOGNISING THE OVERLAP GRAPHS OF SUBTREES OF RESTRICTED TREES IS HARD
Original language description
The article shows several hardness results related to the recognition of special subclasses of subtree overlap graphs.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GA19-08554S" target="_blank" >GA19-08554S: Structures and algorithms in highly symmetric graphs</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2019
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Acta Mathematica Universitatis Comenianae
ISSN
0231-6986
e-ISSN
—
Volume of the periodical
88
Issue of the periodical within the volume
3
Country of publishing house
SK - SLOVAKIA
Number of pages
8
Pages from-to
651-658
UT code for WoS article
000484349000046
EID of the result in the Scopus database
2-s2.0-85073783296