|
| << vorige | volgende >> |
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
Details van artikel 15 van 59 gevonden artikelen
| Titel: |
Confluence in Data Reduction: Bridging Graph Transformation and Kernelization |
| Auteur: |
Ehrig, Hartmut Ermel, Claudia Hüffner, Falk Niedermeier, Rolf Runge, Olga |
| Verschenen in: |
Computability |
| Paginering: | Jaargang 2 (2013) nr. 1 pagina's 31-49 |
| Jaar: |
2013-10-02 |
| Inhoud: |
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 systematic 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. |
| Uitgever: |
IOS Press |
| Bronbestand: |
Elektronische Wetenschappelijke Tijdschriften |
Details van artikel 15 van 59 gevonden artikelen
| << vorige | volgende >> |