direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Page Content

Publications Olga Runge

Confluence in Data Reduction: Bridging Graph Transformation and Kernelization
Citation key EEH+12
Author Hartmut Ehrig and Claudia Ermel and Falk H├╝ffner and Rolf Niedermeier and Olga Runge
Title of Book Proc. of Int. Conf. on Computability in Europe (CiE'12)
Pages 193-202
Year 2012
Volume 7318
Editor S. Barry Cooper and Anuj Dawar
Publisher Springer
Series LNCS
Abstract Kernelization is a core tool of parameterized algorithmics for coping with computationally intractable problems. A \emphkernelization 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 \textsc(Edge) Clique Cover and \textscPartial 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.
Download Bibtex entry

Zusatzinformationen / Extras

Quick Access:

Schnellnavigation zur Seite über Nummerneingabe

Auxiliary Functions