Locally constrained homomorphisms on graphs of bounded degree and bounded treewidth
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F13%3A10145921" target="_blank" >RIV/00216208:11320/13:10145921 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-642-40164-0_14" target="_blank" >http://dx.doi.org/10.1007/978-3-642-40164-0_14</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-40164-0_14" target="_blank" >10.1007/978-3-642-40164-0_14</a>
Alternative languages
Result language
angličtina
Original language name
Locally constrained homomorphisms on graphs of bounded degree and bounded treewidth
Original language description
We study computational complexity of locally constrained homomorphisms when both graphs are a part of the input
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2013
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
Article name in the collection
Fundamentals of Computation Theory
ISBN
978-3-642-40163-3
ISSN
—
e-ISSN
—
Number of pages
12
Pages from-to
121-132
Publisher name
Springer Verlag
Place of publication
Berlin Heidelberg
Event location
Liverpool
Event date
Aug 19, 2013
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—