AN ALGORITHM TO FIND A MAXIMUM MATCHING OF A TRAPEZOID GRAPH

The computation of maximum matching is an important task in graph theory. For general graph an O(√n.m) time algorithm is available to solve this problem. In this paper, an efficient algorithm is presented which takes O(n²) time and O(n+m) space for a trapezoid graph, where n and m represent the number of vertices and the number of edges of the graph.