Recognizing quasi-triangulated graphs Original Research Article

This paper discusses a method for recognizing certain graph classes based on elimination schemes more efficiently. We reduce the time bound for recognizing quasi-triangulated graphs from O(n3) to O(n2.77), and perfect elimination bipartite and cop-win graphs from O(n3) to image.