A Polynomial Algorithm for Homomorphisms to Oriented Cycles

DOI10.1006/JAGM.1995.1040MaRDI QIDQ4857535zbMATH OpenOpenAlexFDO

Authors Xuding Zhu

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

zbMATH Keywords

digraphoriented pathpolynomial time algorithm

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• The Existence of Homomorphisms to Oriented Cycles
• Homomorphisms to oriented cycles
• Homomorphisms to oriented paths
• Directed circuits on a torus
• Homomorphisms to powers of digraphs

Cited in

(10)

• Homomorphisms to oriented paths
• Homomorphisms to powers of digraphs
• Complexity of tree homomorphisms
• Duality pairs and homomorphisms to oriented and unoriented cycles
• The \(C_{k}\)-extended graft construction
• Classification of homomorphisms to oriented cycles and of k-partite satisfiability
• scientific article; zbMATH DE number 2186251 (Why is no real title available?)
• scientific article; zbMATH DE number 1751903 (Why is no real title available?)
• The Existence of Homomorphisms to Oriented Cycles
• Towards a dichotomy theorem for the counting constraint satisfaction problem

This page was built for publication: A Polynomial Algorithm for Homomorphisms to Oriented Cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4857535)