Weakly triangulated comparability graphs
The class of weakly triangulated comparability graphs and their complements are generalizations of interval graphs and chordal comparability graphs. We show that problems on these classes of graphs can be solved efficiently by transforming them into problems on chordal bipartite graphs. We show that recognition and independent set on weakly triangulated comparability graphs can be solved in O(n(2)) time in this manner, and that the number of weakly triangulated comparability graphs is 2(Theta(nlog2n)). We also give algorithms to compute transitive closure and transitive reduction in O(n(2)loglogn) time if the underlying undirected graph of the transitive closure is a weakly triangulated comparability graph.
weakly triangulated comparability algorithm partial orders