16 search results - page 3 / 4 » Ubiquitous Parameterization - Invitation to Fixed-Parameter ... |
CIAC
2010
Springer
13 years 6 months ago
2010
Springer
We study the parameterized complexity of the problems of determining whether a graph contains a k-edge subgraph (k-vertex induced subgraph) that is a -graph for -graphs being one ...
CIAC
2010
Springer
14 years 7 months ago
2010
Springer
Given an arbitrary graph G = (V, E) and an additional set of admissible edges F, the Chordal Sandwich problem asks whether there exists a chordal graph (V, E F ) such that F F. ...
IPL
2010
13 years 4 months ago
2010
In this paper we initiate the study of a "dynamic" variant of the classical Vertex Cover problem, the Eternal Vertex Cover problem introduced by Klostermeyer and Mynhard...
TSP
2008
13 years 9 months ago
2008
Abstract--Removing noise from audio signals requires a nondiagonal processing of time-frequency coefficients to avoid producing "musical noise." State of the art algorith...
GECCO
2007
Springer
14 years 4 months ago
2007
Springer
Recent work has provided functions that can be used to prove a principled distinction between the capabilities of mutation-based and crossover-based algorithms. However, prior fun...