A note on the parameterized complexity of unordered maximum tree orientation
Journal article, 2012

In the Unordered Maximum Tree Orientation problem, a set P of paths in a tree and a parameter k is given, and we want to orient the edges in the tree such that all but at most k paths in P become directed paths. This is a more difficult variant of a well-studied problem in computational biology where the directions of paths in P are already given. We show that the parameterized complexity of the unordered version is between Edge Bipartization and Vertex Bipartization, and we give a characterization of orientable path sets in trees by forbidden substructures, which are cycles of a certain kind.

directed path

parameterized reduction

graph orientation



Sebastian Böcker

Friedrich Schiller University Jena

Peter Damaschke

Chalmers, Computer Science and Engineering (Chalmers), Computing Science (Chalmers)

Discrete Applied Mathematics

0166-218X (ISSN)

Vol. 160 1634-1638

Generalized and fast search strategies for parameterized problems

Swedish Research Council (VR), 2011-01-01 -- 2013-12-31.


Basic sciences

Areas of Advance

Life Science Engineering

Subject Categories

Computer Science