Abstract
The support of a digraph is the undirected graph arising when directions of edges are ignored. We prove that recognizing supports of line digraphs of digraphs is an NP-Complete problem. Then we observe that solvable cases of the directed max-cut problem arise from solvable cases of the maximum-weight stable set problem via supports of line digraphs; in particular, we investigate digraphs G such that the support of the line digraph of G is perfect.
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.
