Linear-time transitive orientation
Conference
·
OSTI ID:471655
- Vanderbilt Univ., Nashville, TN (United States)
The transitive orientation problem is the problem of assigning a direction to each edge of a graph so that the resulting digraph is transitive. A graph is a comparability graph if such an assignment is possible. We describe an O(n + m) algorithm for the transitive orientation problem, where n and m are the number of vertices and edges of the graph; full details are given in. This gives linear time bounds for maximum clique and minimum vertex coloring on comparability graphs, recognition of two-dimensional partial orders, permutation graphs, cointerval graphs, and triangulated comparability graphs, and other combinatorial problems on comparability graphs and their complements.
- OSTI ID:
- 471655
- Report Number(s):
- CONF-970142--; CNN: Grant WE 1265/2-1
- Country of Publication:
- United States
- Language:
- English
Similar Records
Applications of parallel scheduling to perfect graphs. Technical report
Finding a covering triangulation whose maximum angle is provably small
Finding a covering triangulation whose maximum angle is provably small
Technical Report
·
Sun Jun 01 00:00:00 EDT 1986
·
OSTI ID:6978660
Finding a covering triangulation whose maximum angle is provably small
Conference
·
Tue Mar 02 23:00:00 EST 1993
·
OSTI ID:10148829
Finding a covering triangulation whose maximum angle is provably small
Conference
·
Tue Mar 02 23:00:00 EST 1993
·
OSTI ID:6518556