Publication:5365149
From MaRDI portal
zbMath1376.68067MaRDI QIDQ5365149
Publication date: 29 September 2017
Full work available at URL: http://dl.acm.org/citation.cfm?id=2133167
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
68P05: Data structures
05C20: Directed graphs (digraphs), tournaments
Related Items
Unnamed Item, Algebra and the Complexity of Digraph CSPs: a Survey, The smallest hard trees, List-homomorphism problems on graphs and arc consistency, Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms, List H-coloring a graph by removing few vertices, Complexity of correspondence \(H\)-colourings, On Maltsev digraphs, Dichotomy for tree-structured trigraph list homomorphism problems, The \(C_{k}\)-extended graft construction, Subexponential algorithms for variants of the homomorphism problem in string graphs, Parameterized algorithms for min-max multiway cut and list digraph homomorphism, Correspondence homomorphisms to reflexive graphs, Graph partitions with prescribed patterns, CSP for binary conservative relational structures, Minimum Cost Homomorphisms with Constrained Costs, On Maltsev Digraphs