A Polynomial Algorithm for Homomorphisms to Oriented Cycles
From MaRDI portal
Publication:4857535
DOI10.1006/jagm.1995.1040zbMath0836.68089OpenAlexW2065988537MaRDI QIDQ4857535
Publication date: 11 April 1996
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1995.1040
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)
Related Items (3)
Towards a dichotomy theorem for the counting constraint satisfaction problem ⋮ Complexity of tree homomorphisms ⋮ Duality pairs and homomorphisms to oriented and unoriented cycles
This page was built for publication: A Polynomial Algorithm for Homomorphisms to Oriented Cycles