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...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of graph algorithms and applications Ročník 29; číslo 1; s. 247 - 266
Hlavní autori:	Binucci, Carla, Liotta, Giuseppe, Montecchiani, Fabrizio, Ortali, Giacomo, Piselli, Tommaso
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	12.08.2025
ISSN:	1526-1719, 1526-1719
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!