One-Way Trail Orientations
Anders Aamand, Niklas Hjuler, Jacob Holm, Eva Rotenberg

TL;DR
This paper extends Robbins' theorem to trail partitions, providing a linear time algorithm to determine if edges can be oriented to achieve strong connectivity, and generalizes to mixed multigraphs with a new polynomial time solution.
Contribution
It introduces a polynomial time algorithm for orienting trail-partitioned graphs to be strongly connected and generalizes Robbins' theorem to certain mixed multigraphs.
Findings
Linear time algorithm for trail orientation problem
Extension of Robbins' theorem to trail partitions
Polynomial time solution for mixed multigraph orientation
Abstract
Given a graph, does there exist an orientation of the edges such that the resulting directed graph is strongly connected? Robbins' theorem [Robbins, Am. Math. Monthly, 1939] states that such an orientation exists if and only if the graph is -edge connected. A natural extension of this problem is the following: Suppose that the edges of the graph is partitioned into trails. Can we orient the trails such that the resulting directed graph is strongly connected? We show that -edge connectivity is again a sufficient condition and we provide a linear time algorithm for finding such an orientation, which is both optimal and the first polynomial time algorithm for deciding this problem. The generalised Robbins' theorem [Boesch, Am. Math. Monthly, 1980] for mixed multigraphs states that the undirected edges of a mixed multigraph can be oriented making the resulting directed graph…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Complexity and Algorithms in Graphs · Interconnection Networks and Systems
