Recognizing quasi-triangulated graphs

Authors:
Jeremy P. Spinrad
Affiliations:
Department of EECS, Vanderbilt University, Nashville, TN
Venue:
Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
Year:
2004

Citing 5
Cited 1

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
Graph classes: a survey

Graph classes: a survey

The clique operator on circular-arc graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

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(n3) to O(n2.77), and perfect elimination bipartite and cop-win graphs from O(n3) to O(n3/log n).