Year: 1983
Type: conference-paper
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.
Author: Jeremy Spinrad
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W1964328451
