Transitive orientation in 0(n2) time

Authors:
Jeremy Spinrad
Affiliations:
-
Venue:
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Year:
1983

Citing 2
Cited 2

Permutation Graphs and Transitive Graphs

Journal of the ACM (JACM)
Two-dimensional partial orders

Two-dimensional partial orders

LexBFS-Ordering in Asteroidal Triple-Free Graphs

ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Finding minimum dominating cycles in permutation graphs

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an algorithm for the transitive graph orientation problem which runs in 0(n2) time. The best previous algorithms for this problem required 0(n3) time. Transitive orientation is the slowest part of several graph recognition problems, so the new algorithm immediately improves the complexity of algorithms for recognizing comparability graphs, permutation graphs, and circular permutation graphs.