Abstract
We study the problem, given a hypergraph H, how to generate its transversal (or dual) hypergraph G, using tools from Boolean resolution. We show how to compute the residual dual of H given a subset E of its minimal transversals. This is the hypergraph whose minimal transversals are exactly those missing from E to become the dual of H. We give a novel algorithm for the problem based on the notion of subtransversal. Though its complexity is superpolynomial, it gives new insight to the problem of hypergraph duality. Another variant of the algorithm seems also promising to efficiently test hypergraph duality in practice.
Sign-in/Register to access full text options 
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.
