Abstract
Gutjahr, Welzl and Woeginger found polynomial-time algorithms for a number of digraph homomorphism problems. These algorithms are based on the X ¯ -enumeration, the C k -extended X ¯ -enumeration and the X ¯ -graft construction. In this note, we show how the last two methods can be combined to obtain new polynomial-time algorithms, which also work for list homomorphisms. In the process, we are able to extend results of Bang-Jensen and Hell, dealing with homomorphisms to bipartite tournaments, to list homomorphisms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
