Locally consistent constraint satisfaction problems with binary constraints
Result description
We study locally consistent constraint satisfaction problems with binary constraints and show their close relationship to the notion of homomorphism tree duals.
Keywords
Locallyconsistentconstraintsatisfactionproblemsbinaryconstraints
The result's identifiers
Result code in IS VaVaI
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Locally consistent constraint satisfaction problems with binary constraints
Original language description
We study locally consistent constraint satisfaction problems with binary constraints and show their close relationship to the notion of homomorphism tree duals.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2005
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
Graph-theoretic Concepts in Computer Science
ISBN
3-540-31000-2
ISSN
—
e-ISSN
—
Number of pages
12
Pages from-to
—
Publisher name
Springer
Place of publication
Berlin
Event location
Berlin
Event date
Jan 1, 2005
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000234875500026
Basic information
Result type
D - Article in proceedings
CEP
BA - General mathematics
Year of implementation
2005