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