Abstract
A cyclic order in the vertex set of a digraph is said to be coherent if any arc is contained in a directed cycle whose winding number is one. This notion plays a key role in the proof by Bessy and Thomassé (2004) of a conjecture of Gallai (1964) on covering the vertex set by directed cycles. This paper presents an efficient algorithm for finding a coherent cyclic order in a strongly connected digraph, based on a theorem of Knuth (1974). With the aid of ear decomposition, the algorithm runs in O(nm) time, where n is the number of vertices and m is the number of arcs. This is as fast as testing if a given cyclic order is coherent.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Bessy and S. Thomassé: Three min-max theorems concerning cyclic orders of strong digraphs, in Integer Programming and Combinatorial Optimization, D. Bienstock and G. Nemhauser, eds., LNCS 3064, Springer-Verlag, 2004, pp. 132–138.
D. E. Knuth: Wheels within wheels, J. Combinatorial Theory, Ser. B 16 (1974), 42–46.
J. B. Orlin: A faster strongly polynomial minimum cost flow algorithm, Oper. Res. 41 (1993), 338–350.
A. Schrijver: Combinatorial Optimization — Polyhedra and Efficiency, Springer-Verlag, 2003.
A. Sebő: Minmax relations for cyclically ordered digraphs, J. Combinatorial Theory, Ser. B 97(4) (2007), 518–552.