On the Parameterized Complexity of Computing $st$-Orientations with Few Transitive Edges
Abstract
Orienting the edges of an undirected graph such that the resulting digraph satisfies some given constraints is a classical problem in graph theory, with multiple algorithmic applications. In particular, an -orientation orients each edge of the input graph such that the resulting digraph is acyclic, and it contains a single source and a single sink . Computing an -orientation of a graph can be done efficiently, and it finds notable applications in graph algorithms and in particular in graph drawing. On the other hand, finding an -orientation with at most transitive edges is more challenging and it was recently proven to be NP-hard already when . We strengthen this result by showing that the problem remains NP-hard even for graphs of bounded diameter, and for graphs of bounded vertex degree. These computational lower bounds naturally raise the question about which structural parameters can lead to tractable parameterizations of the problem. Our main result is a fixed-parameter tractable algorithm parameterized by treewidth.
Cite
@article{arxiv.2306.03196,
title = {On the Parameterized Complexity of Computing $st$-Orientations with Few Transitive Edges},
author = {Carla Binucci and Giuseppe Liotta and Fabrizio Montecchiani and Giacomo Ortali and Tommaso Piselli},
journal= {arXiv preprint arXiv:2306.03196},
year = {2023}
}