Simpler, Linear-Time Transitive Orientation via Lexicographic Breadth-First Search

@article{Tedder2015SimplerLT,
  title={Simpler, Linear-Time Transitive Orientation via Lexicographic Breadth-First Search},
  author={Marc Tedder},
  journal={CoRR},
  year={2015},
  volume={abs/1503.02773}
}
Comparability graphs are the undirected graphs whose edges can be directed so that the resulting directed graph is transitive. They are related to posets and have applications in scheduling theory. This paper considers the problem of finding a transitive orientation of a comparability graph, a requirement for many of its applications. A linear-time… CONTINUE READING