Abstract
In this paper, we deal with both the complexity and the approximability of the labeled perfect matching problem in bipartite graphs. Given a simple graph G = ( V , E ) with | V | = 2 n vertices such that E contains a perfect matching (of size n), together with a color (or label) function L : E → { c 1 , … , c q } , the labeled perfect matching problem consists in finding a perfect matching on G that uses a minimum or a maximum number of colors.
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.
