On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges

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 $st$-orientation orients each edge of the input graph such that the resulting digraph is acycl...

Full description

Bibliographic Details

Published in:	Journal of graph algorithms and applications Vol. 29; no. 1; pp. 247 - 266
Main Authors:	Binucci, Carla, Liotta, Giuseppe, Montecchiani, Fabrizio, Ortali, Giacomo, Piselli, Tommaso
Format:	Journal Article
Language:	English
Published:	12.08.2025
ISSN:	1526-1719, 1526-1719
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!