2 research outputs found
Linear time algorithms to solve the linear ordering problem for oriented tree based graphs
We present in this paper two simple linear algorithms that solve to optimality the linear
ordering problem for unweighted tree based graphs viz. the oriented trees
and the oriented divide-and-conquer graphs