Note: A note on the parameterized complexity of unordered maximum tree orientation

Authors:
Sebastian Böcker;Peter Damaschke
Affiliations:
Lehrstuhl für Bioinformatik, Friedrich-Schiller-Universität Jena, Ernst-Abbe-Platz 2, 07743 Jena, Germany;Department of Computer Science and Engineering, Chalmers University, S-41296 Göteborg, Sweden
Venue:
Discrete Applied Mathematics
Year:
2012

Citing 9
Cited 0

Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization

Journal of Computer and System Sciences
Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques

Theory of Computing Systems
An Algorithm for Orienting Graphs Based on Cause-Effect Pairs and Its Applications to Orienting Protein Networks

WABI '08 Proceedings of the 8th international workshop on Algorithms in Bioinformatics
Simpler Parameterized Algorithm for OCT

Combinatorial Algorithms
A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams

Parameterized and Exact Computation
Improved upper bounds for vertex cover

Theoretical Computer Science
Approximation algorithms for orienting mixed graphs

CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Finding odd cycle transversals

Operations Research Letters
Parameterized Complexity

Parameterized Complexity

Quantified Score

Hi-index	0.04

Visualization

Abstract

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.