A note on optical routing on trees
Information Processing Letters
Optimal wavelength routing on directed fiber trees
Theoretical Computer Science
The complexity of path coloring and call scheduling
Theoretical Computer Science
Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
The Maximum Edge-Disjoint Paths Problem in Bidirected Trees
SIAM Journal on Discrete Mathematics
Maximizing the Number of Connections in Optical Tree Networks
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Call control with k rejections
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Linear FPT reductions and computational lower bounds
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity
Combinatorial Optimization on Graphs of Bounded Treewidth
The Computer Journal
| Hi-index | 0.00 |
We study the well-known Max Path Coloring problem from a parameterized point of view, focusing on trees and low-treewidth networks. We observe the existence of a variety of reasonable parameters for the problem, such as the maximum degree and treewidth of the network graph, the number of available colors and the number of requests one seeks to satisfy or reject. In an effort to understand the impact of each of these parameters on the problem's complexity we study various parameterized versions of the problem deriving fixed-parameter tractability and hardness results both for undirected and bi-directed graphs.