暂无分享,去创建一个
[1] Erik D. Demaine,et al. PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation , 2002, Theor. Comput. Sci..
[2] Dmitriy Zhuk,et al. A Proof of CSP Dichotomy Conjecture , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[3] Jirí Fiala,et al. A complete complexity classification of the role assignment problem , 2005, Theor. Comput. Sci..
[4] M. Siggers. A strong Mal’cev condition for locally finite varieties omitting the unary type , 2010 .
[5] Jaroslav Nesetril,et al. On the complexity of H-coloring , 1990, J. Comb. Theory, Ser. B.
[6] Richard C. Brewster,et al. A dichotomy theorem for circular colouring reconfiguration , 2015, Theor. Comput. Sci..
[7] Marcin Wrochna. Homomorphism reconfiguration via homotopy , 2015, STACS.
[8] Libor Barto,et al. The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell) , 2008, SIAM J. Comput..
[9] Richard Brewster. Vertex colourings of edge-coloured graphs , 1993 .
[10] Andrei A. Bulatov,et al. A Dichotomy Theorem for Nonuniform CSPs , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[11] Jan van den Heuvel,et al. The complexity of change , 2013, Surveys in Combinatorics.
[12] Paul S. Bonsma,et al. Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distances , 2007, Theor. Comput. Sci..
[13] Tomás Feder,et al. Dichotomy for Digraph Homomorphism Problems (two algorithms) , 2017 .
[14] D. Stanovský. POLYMORPHISMS OF SMALL DIGRAPHS , 2010 .
[15] Richard C. Brewster,et al. Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings , 2015, J. Graph Theory.
[16] Tomás Feder,et al. Dichotomy for Digraph Homomorphism Problems , 2017, ArXiv.
[17] Mark Siggers. A New Proof of the $H$-Coloring Dichotomy , 2009 .
[18] N. Alon,et al. Homomorphisms of Edge-Colored Graphs and Coxeter Groups , 1998 .
[19] Dejan Deli'c. Constraint Satisfaction Problem Dichotomy for Finite Templates: a Proof Via Consistency Checks , 2017 .
[20] Marcel Jackson,et al. Axiomatisability and hardness for universal Horn classes of hypergraphs , 2017, ArXiv.
[21] Richard C. Brewster. The Complexity of Colouring Symmetric Relational Systems , 1994, Discret. Appl. Math..
[22] Claude Tardif. Multiplicative graphs and semi-lattice endomorphisms in the category of graphs , 2005, J. Comb. Theory, Ser. B.
[23] Richard C. Brewster,et al. Recolouring reflexive digraphs , 2018, Discret. Math..
[24] Richard C. Brewster,et al. The complexity of signed graph and edge-coloured graph homomorphisms , 2015, Discret. Math..
[25] Ross Willard,et al. Refuting Feder, Kinne and Rafiey , 2017, ArXiv.
[26] Peter Winkler,et al. Vertex-to-vertex pursuit in a graph , 1983, Discret. Math..
[27] Naomi Nishimura,et al. Introduction to Reconfiguration , 2018, Algorithms.
[28] Andrei A. Bulatov. H-Coloring dichotomy revisited , 2005, Theor. Comput. Sci..
[29] Tomás Feder,et al. The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory , 1999, SIAM J. Comput..
[30] Jan van den Heuvel,et al. Finding paths between 3‐colorings , 2011, IWOCA.
[31] Daniël Paulusma,et al. Finding Shortest Paths Between Graph Colourings , 2014, Algorithmica.
[32] Mario Szegedy,et al. A new line of attack on the dichotomy conjecture , 2009, STOC '09.
[33] Marcin Wrochna. Square-free graphs are multiplicative , 2017, J. Comb. Theory, Ser. B.