About: CSP DICHOTOMY FOR SPECIAL POLYADS

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: CSP DICHOTOMY FOR SPECIAL POLYADS Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
rdfs:seeAlso	http://dx.doi.org/10.1142/S0218196713500215
Description	For a digraph H, the Constraint Satisfaction Problem with template H, or CSP(H), is the problem of deciding whether a given input digraph G admits a homomorphism to H. The CSP dichotomy conjecture of Feder and Vardi states that for any digraph H, CSP(H) is either in P or NP-complete. Barto, Kozik, Maroti and Niven (Proc. Amer. Math. Soc. 137 (2009) 2921-2934) confirmed the conjecture for a class of oriented trees called special triads. We generalize this result, establishing the dichotomy for a class of oriented trees which we call special polyads. We prove that every tractable special polyad has bounded width and provide the description of special polyads of width 1. We also construct a tractable special polyad which neither has width 1 nor admits any near-unanimity polymorphism. For a digraph H, the Constraint Satisfaction Problem with template H, or CSP(H), is the problem of deciding whether a given input digraph G admits a homomorphism to H. The CSP dichotomy conjecture of Feder and Vardi states that for any digraph H, CSP(H) is either in P or NP-complete. Barto, Kozik, Maroti and Niven (Proc. Amer. Math. Soc. 137 (2009) 2921-2934) confirmed the conjecture for a class of oriented trees called special triads. We generalize this result, establishing the dichotomy for a class of oriented trees which we call special polyads. We prove that every tractable special polyad has bounded width and provide the description of special polyads of width 1. We also construct a tractable special polyad which neither has width 1 nor admits any near-unanimity polymorphism. (en)
Title	CSP DICHOTOMY FOR SPECIAL POLYADS CSP DICHOTOMY FOR SPECIAL POLYADS (en)
skos:prefLabel	CSP DICHOTOMY FOR SPECIAL POLYADS CSP DICHOTOMY FOR SPECIAL POLYADS (en)
skos:notation	RIV/00216208:11320/13:10174135!RIV14-GA0-11320___
http://linked.open...avai/predkladatel	Matematicko-fyzikální fakulta
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(GP201/09/P223), Z(MSM0021620839)
http://linked.open...iv/cisloPeriodika	5
http://linked.open...vai/riv/dodaniDat	2014
http://linked.open...aciTvurceVysledku	Barto, Libor Bulín, Jakub
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Univerzita Karlova v Praze / Matematicko-fyzikální fakulta
http://linked.open...dnocenehoVysledku	67421
http://linked.open...ai/riv/idVysledku	RIV/00216208:11320/13:10174135
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	special triad; bounded width; graph coloring; Constraint satisfaction problem (en)
http://linked.open.../riv/klicoveSlovo	Constraint satisfaction problem graph coloring special triad bounded width
http://linked.open...odStatuVydavatele	US - Spojené státy americké
http://linked.open...ontrolniKodProRIV	[F2F56D812883]
http://linked.open...i/riv/nazevZdroje	International Journal of Algebra and Computation
http://linked.open...in/vavai/riv/obor	BA
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Constraint satisfaction problem and universal algebra
http://linked.open...UplatneniVysledku	2013
http://linked.open...v/svazekPeriodika	23
http://linked.open...iv/tvurceVysledku	Barto, Libor Bulín, Jakub
http://linked.open...ain/vavai/riv/wos	000323514700007
http://linked.open...n/vavai/riv/zamer	Metody moderní matematiky a jejich aplikace
issn	0218-1967
number of pages	24 (xsd:int)
http://bibframe.org/vocab/doi	10.1142/S0218196713500215
http://localhost/t...ganizacniJednotka	11320

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software