Confluence in Data Reduction: Bridging Graph Transformation and Kernelization
Kernelization is a core tool of parameterized algorithmics for coping with computationally intractable problems. A kernelization reduces in polynomial time an input instance to an equivalent instance whose size is bounded by a function only depending on some problem-specific parameter k; this new instance is called problem kernel. Typically, problem kernels are achieved by performing efficient data reduction rules. So far, there was little study in the literature concerning the mutual interaction of data reduction rules, in particular whether data reduction rules for a specific problem always lead to the same reduced instance, no matter in which order the rules are applied. This corresponds to the concept of confluence from the theory of rewriting systems. We argue that it is valuable to study whether a kernelization is confluent, using the NP-hard graph problems (Edge) Clique Cover and Partial Clique Cover as running examples. We apply the concept of critical pair analysis from graph transformation theory, supported by the AGG software tool. These results support the main goal of our work, namely, to establish a fruitful link between (parameterized) algorithmics and graph transformation theory, two so far unrelated fields.
Unable to display preview. Download preview PDF.
- 1.AGG: Attributed Graph Grammar Tool. TU Berlin (2011), http://tfs.cs.tu-berlin.de/agg
- 4.Cygan, M., Kratsch, S., Pilipczuk, M., Pilipczuk, M., Wahlström, M.: Clique cover and graph separation: New incompressibility results. Tech. Rep. arXiv:1111.0570v1 [cs.DS], arXiv (2011)Google Scholar
- 5.Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999)Google Scholar
- 6.Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. EATCS Monographs in Theoretical Computer Science. Springer (2006)Google Scholar
- 7.Ehrig, H., Kreowski, H.J., Montanari, U., Rozenberg, G. (eds.): Handbook of Graph Grammars and Computing by Graph Transformation. Concurrency, Parallelism and Distribution, vol. 3. World Scientific (1999)Google Scholar
- 8.Ehrig, H., Pfender, M., Schneider, H.: Graph grammars: an algebraic approach. In: Proc. IEEE Symposium on Switching and Automata Theory, pp. 167–180. IEEE (1973)Google Scholar
- 9.Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)Google Scholar
- 10.Gramm, J., Guo, J., Hüffner, F., Niedermeier, R.: Data reduction and exact algorithms for clique cover. ACM Journal of Experimental Algorithmics 13, 2.2:1–2.2:15 (2008)Google Scholar
- 15.van Leeuwen, J. (ed.): Handbook of Theoretical Computer Science. MIT Press (1990)Google Scholar
- 18.Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications, vol. 31. Oxford University Press (2006)Google Scholar
- 20.Rozenberg, G.: Handbook of Graph Grammars and Computing by Graph Transformations: Foundations, vol. 1. World Scientific (1997)Google Scholar