5 citations · 8 across the 3 of their papers we have counts for
4 papers · 1 filter
Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration
Petr A. Golovach, Christian Komusiewicz, Dieter Kratsch +1
An enumeration kernel as defined by Creignou et al. [Theory Comput. Syst. 2017] for a parameterized enumeration problem consists of an algorithm that transforms each instance into…
Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch
Connected Vertex Cover is one of the classical problems of computer science, already mentioned in the monograph of Garey and Johnson. Although the optimization and decision variant…
Generating All Minimal Edge Dominating Sets with Incremental-Polynomial Delay
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch +1
For an arbitrary undirected simple graph G with m edges, we give an algorithm with running time O(m^4 |L|^2) to generate the set L of all minimal edge dominating sets of G. For bip…
Breaking the 2^n-Barrier for Irredundance: A Parameterized Route to Solving Exact Puzzles
Ljiljana Brankovic, Henning Fernau, Joachim Kneis +1
The lower and the upper irredundance numbers of a graph , denoted and respectively, are conceptually linked to domination and independence numbers and have numer…