A transitive orientation of an undirected graph is an assignment of directions to its edges so that these directed edges represent a transitive relation between the vertices of the graph. Not every graph has a transitive orientation, but every graph can be turned into a graph that has a transitive orientation, by adding edges. We study the problem of adding an inclusion minimal set of edges to an arbitrary graph so that the resulting graph is transitively orientable. We show that this problem can be solved in polynomial time, and we give a surprisingly simple algorithm for it. © 2006 Springer-Verlag Berlin/Heidelberg.
CITATION STYLE
Heggernes, P., Mancini, F., & Papadopoulos, C. (2006). Making arbitrary graphs transitively orientable: Minimal comparability completions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4288 LNCS, pp. 419–428). https://doi.org/10.1007/11940128_43
Mendeley helps you to discover research relevant for your work.