Parameterized Problems on Coincidence Graphs
A (k,r)-tuple is a word of length r on an alphabet of size k. A graph is (k,r)-representable if we can assign a (k,r)-tuple to each vertex such that two vertices are connected iff the associated tuples agree on some component. We study the complexity of several graph problems on (k,r)-representable graphs, as a function of the parameters k,r; the problems under study are Maximum Independent Set, Minimum Dominating Set and Maximum Clique. In this framework, there are two classes of interest: the graphs representable with tuples of logarithmic length (i.e. graphs (k,r)-representable with r = O(k logn)), and the graphs representable with tuples of polynomial length (i.e. graphs (k,r)-representable with r = poly(n)). In both cases, we show that the problems are computationally hard, though we obtain stronger hardness results in the second case. Our hardness results also allow us to derive optimality results for Multidimensional Matching and Disjoint r -Subsets.
KeywordsVertex Cover Maximum Clique Parameterized Problem Hardness Result Hash Family
Unable to display preview. Download preview PDF.
- 8.Downey, R., Estivill, V., Fellows, M., Prieto, E., Rosamond, F.: Cutting up is hard to do: the parameterized complexity of k-cut and related problems. In: Proceedings of CATS 2003. ENTCS, vol. 78 (2003)Google Scholar
- 9.Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)Google Scholar
- 10.Fellows, M., Knauer, C., Nishimura, N., Ragde, P., Rosamonds, F., Stege, U., Thilikos, D., Whitesides, S.: Faster fixed-parameter tractable algorithms for matching and packing problems. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 311–322. Springer, Heidelberg (2004)CrossRefGoogle Scholar
- 12.Mehlhorn, K.: Data Structures and Algorithms. Springer, Heidelberg (1990)Google Scholar