Graphs, polymorphisms and the complexity of homomorphism problems-Reference-Cited by-同舟云学术

Graphs, polymorphisms and the complexity of homomorphism problems

Published:2008-05-17 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the fortieth annual ACM symposium on Theory of computing
language:
Short-container-title:

Author:

Barto Libor¹,Kozik Marcin²,Niven Todd³

Affiliation:

1. ECC and Charles University, Praha, Czech Rep

2. Jagiellonian University and ECC (Charles University), Krakow and Praha, Poland

3. ECC, Praha, Czech Rep

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/1374376.1374488

Reference28 articles.

1. The effect of two cycles on the complexity of colourings by directed graphs

2. Libor Barto Marcin Kozik Miklós Maróti and Todd Niven. Csp dichotomy for special triads. in preparation.]] Libor Barto Marcin Kozik Miklós Maróti and Todd Niven. Csp dichotomy for special triads. in preparation.]]

3. Libor Barto Marcin Kozik and Todd Niven. The csp dichotomy holds for digraphs with no sources and no sinks (a positive answer to a conjecture of bang-jensen and hell). submitted.]] Libor Barto Marcin Kozik and Todd Niven. The csp dichotomy holds for digraphs with no sources and no sinks (a positive answer to a conjecture of bang-jensen and hell). submitted.]]

4. Classifying the Complexity of Constraints Using Finite Algebras

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Tight Lower Bounds on Graph Embedding Problems;Journal of the ACM;2017-06-22

2. Dualities and algebras with a near-unanimity term;Algebra universalis;2016-07-23

3. Lower Bounds for the Graph Homomorphism Problem;Automata, Languages, and Programming;2015

4. The complexity of the counting constraint satisfaction problem;Journal of the ACM;2013-10

5. Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem;Logical Methods in Computer Science;2012-02-20