On Maltsev Digraphs

DOI10.1007/978-3-642-20712-9_14zbMath1332.68068OpenAlexW1874576524MaRDI QIDQ3007626

László Egri, Marcel Jackson, Catarina A. Carvalho, Todd Niven

Publication date: 17 June 2011

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2299/16610

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of universal algebra in computer science (08A70) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Quantified Constraint Satisfaction Problem on Semicomplete Digraphs ⋮ Tractability in constraint satisfaction problems: a survey ⋮ On Maltsev digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maltsev digraphs have a majority polymorphism
• Existence theorems for weakly symmetric operations
• On the complexity of H-coloring
• On \(n\)-permutable congruences
• Majority constraints have bounded pathwidth duality
• On the complexity of #CSP
• CSP dichotomy for special triads
• Closure properties of constraints
• Linear Datalog and Bounded Path Duality of Relational Structures
• Classifying the Complexity of Constraints Using Finite Algebras
• A Simple Algorithm for Mal'tsev Constraints
• Dualities for Constraint Satisfaction Problems

This page was built for publication: On Maltsev Digraphs