The minimum labeling spanning trees
Information Processing Letters
On the minimum label spanning tree problem
Information Processing Letters
On the red-blue set cover problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Introduction to Algorithms
A note on the minimum label spanning tree
Information Processing Letters
Algorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs
ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
Two Formal Analys s of Attack Graphs
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Convex recolorings of strings and trees: Definitions, hardness results and algorithms
Journal of Computer and System Sciences
On the parameterized complexity of multiple-interval graph problems
Theoretical Computer Science
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
Theory of Computing Systems - Special Issue: Computation and Logic in the Real World; Guest Editors: S. Barry Cooper, Elvira Mayordomo and Andrea Sorbi
On problems without polynomial kernels
Journal of Computer and System Sciences
The labeled perfect matching in bipartite graphs
Information Processing Letters
A one-parameter genetic algorithm for the minimum labeling spanning tree problem
IEEE Transactions on Evolutionary Computation
Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem
Operations Research Letters
On the rainbow connectivity of graphs: complexity and FPT algorithms
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Approximating minimum label s-t cut via linear programming
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
| Hi-index | 0.00 |
We study the parameterized complexity of several minimum label graph problems, in which we are given an undirected graph whose edges are labeled, and a property @P, and we are asked to find a subset of edges satisfying property @P with respect to G that uses the minimum number of labels. These problems have a lot of applications in networking. We show that all the problems under consideration are W[2]-hard when parameterized by the number of used labels, and that they remain W[2]-hard even on graphs whose pathwidth is bounded above by a small constant. On the positive side, we prove that most of these problems are FPT when parameterized by the solution size, that is, the size of the sought edge set. For example, we show that computing a maximum matching or an edge dominating set that uses the minimum number of labels, is FPT when parameterized by the solution size. Proving that some of these problems are FPT requires interesting algorithmic methods that we develop in this paper.