Recognizing quasi-triangulated graphs

Authors:
Jeremy P Spinrad
Affiliations:
Department of EECS, Vanderbilt University, Nashville, TN 37235, USA
Venue:
Discrete Applied Mathematics
Year:
2004

Citing 4
Cited 4

A note on perfect orders

Discrete Mathematics - Graph colouring and variations
Matrix multiplication via arithmetic progressions

Journal of Symbolic Computation - Special issue on computational algebraic complexity
On the complexity of recognizing perfectly orderable graphs

Discrete Mathematics
Fast rectangular matrix multiplication and applications

Journal of Complexity

Recognizing sparse perfect elimination Bipartite graphs

CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Arboricity, h-index, and dynamic algorithms

Theoretical Computer Science
Finding and listing induced paths and cycles

Discrete Applied Mathematics
Bisimplicial edges in bipartite graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.05

Visualization

Abstract

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(n^3) to O(n^2^.^7^7), and perfect elimination bipartite and cop-win graphs from O(n^3) to O(n^3/logn).