Sciweavers

45 search results - page 7 / 9
» Distortion Is Fixed Parameter Tractable
Sort
View
TIP
2010
107views more  TIP 2010»
13 years 2 months ago
Risk-Distortion Analysis for Video Collusion Attacks: A Mouse-and-Cat Game
Copyright protection is a key issue for video sharing over public networks. To protect the video content from unauthorized redistribution, digital fingerprinting is commonly used. ...
Yan Chen, W. Sabrina Lin, K. J. Ray Liu
CIAC
2010
Springer
251views Algorithms» more  CIAC 2010»
14 years 4 months ago
A parameterized algorithm for Chordal Sandwich
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. ...
Pinar Heggernes, Federico Mancini, Jesper Nederlof...
CIAC
2010
Springer
281views Algorithms» more  CIAC 2010»
13 years 4 months ago
Parameterized Complexity of Even/Odd Subgraph Problems
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 ...
Leizhen Cai, Boting Yang
CSL
2009
Springer
13 years 11 months ago
Tree-Width for First Order Formulae
We introduce tree-width for first order formulae , fotw(). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formul...
Isolde Adler, Mark Weyer
SODA
2010
ACM
235views Algorithms» more  SODA 2010»
14 years 4 months ago
Algorithmic Lower Bounds for Problems Parameterized by Clique-width
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtano...