Learn More
Given a digraph G=(V, E), call a node set T C_ V path-closed if v, v'E T and wE V is on a path from v to v' implies wE T. If G is the comparability graph of a poser P, the path-closed sets of G are(More)