scientific article; zbMATH DE number 5030273
From MaRDI portal
Publication:5471351
zbMath1100.08003MaRDI QIDQ5471351
Publication date: 6 June 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of universal algebra in computer science (08A70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Directed graphs (digraphs), tournaments (05C20)
Related Items (16)
Quantified Constraint Satisfaction Problem on Semicomplete Digraphs ⋮ Satisfiability in MultiValued Circuits ⋮ A strong Mal'cev condition for locally finite varieties omitting the unary type ⋮ Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms ⋮ Recolouring homomorphisms to triangle-free reflexive graphs ⋮ Surjective polymorphisms of directed reflexive cycles ⋮ Colouring, constraint satisfaction, and complexity ⋮ On the fixed point property for \((3 + 1)\)-free ordered sets ⋮ Quantified Constraints in Twenty Seventeen ⋮ Algebra and the Complexity of Digraph CSPs: a Survey ⋮ Reconfiguring graph homomorphisms on the sphere ⋮ Rigid binary relations on a 4-element domain ⋮ A discrete homotopy theory for binary reflexive structures ⋮ Dichotomy for finite tournaments of mixed-type ⋮ Adjusted Interval Digraphs ⋮ A quasi-Mal'cev condition with unexpected application.
This page was built for publication:
