7 citations · 9 across the 5 of their papers we have counts for
3 papers · 1 filter
On Finding Optimal Polytrees
Serge Gaspers, Mikko Koivisto, Mathieu Liedloff +2
Inferring probabilistic networks from data is a notoriously difficult task. Under various goodness-of-fit measures, finding an optimal network is NP-hard, even if restricted to pol…
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…
Exact Exponential Time Algorithms for Max Internal Spanning Tree
Henning Fernau, Serge Gaspers, Daniel Raible
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our…