On the computational complexity of partial covers of theta graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F08%3A00101003" target="_blank" >RIV/00216208:11320/08:00101003 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
On the computational complexity of partial covers of theta graphs
Original language description
In the paper is classified computational complexity of several problems on graph covering, where the target graph is a theta graph.
Czech name
O výpočetní složitosti nakrýváni Theta grafů
Czech description
V článku je určena výpočetní složitost problému narývání grafů pro několik tříd tzv. Theta grafů.
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
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)
Others
Publication year
2008
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
Discrete Applied Mathematics
ISSN
0166-218X
e-ISSN
—
Volume of the periodical
156
Issue of the periodical within the volume
7
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
7
Pages from-to
—
UT code for WoS article
000254982300015
EID of the result in the Scopus database
—