Abstract
Trapezoid graphs are intersection graphs of trapezoids between two horizontal lines. Many graph problems that are NP-hard in general case have polynomial time algorithms for trapezoid graphs. A matching in a graph is a set of pairwise non-adjacent edges, and a maximum matching is a matching whose cardinality is maximum. In this paper, we define a modified range tree data structure, called S-Range tree, which allows to report the maximum label of points in a rectangular region and update the label of a point efficiently. We use this data structure to construct an O(n(log n) <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">3</sup> ) algorithm for finding a maximum matching in trapezoid graphs based on their box representation. In addition, we generalize this algorithm for a larger graph class, k-trapezoid graph by using multidimensional range tree. To the best of our knowledge, this is the first efficient maximum matching algorithm for trapezoid graphs.
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.
