Results 61 to 70 of about 1,615,193 (298)
Some Open Problems in Parameterized Complexity Related to the Work of Jianer Chen
Tsinghua Science and Technology, 2014 This short paper highlights some open problems related to the work of Jianer Chen in the area of parameterized/multivariate algorithmics.
Michael Ralph Fellows
doaj +1 more source
A Brief Survey of Fixed-Parameter Parallelism
Algorithms, 2020 This paper provides an overview of the field of parameterized parallel complexity by surveying previous work in addition to presenting a few new observations and exploring potential new directions.
Faisal N. Abu-Khzam, Karam Al Kontar
doaj +1 more source
Improving Vertex Cover as a Graph Parameter [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Parameterized algorithms are often used to efficiently solve NP-hard problems on graphs. In this context, vertex cover is used as a powerful parameter for dealing with graph problems which are hard to solve even when parameterized by tree-width; however,
Robert Ganian
doaj +1 more source
Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293)
, 2021 This report documents the program and the outcomes of Dagstuhl Seminar 21293 "Parameterized Complexity in Graph Drawing". The seminar was held mostly in-person from July 18 to July 23, 2021.
Ganian, Robert +3 more
core +1 more source
The Parameterized Complexity of Graph Cyclability [PDF]
SIAM Journal on Discrete Mathematics, 2014 The cyclability of a graph is the maximum integer $k$ for which every $k$ vertices lie on a cycle. The algorithmic version of the problem, given a graph $G$ and a non-negative integer $k,$ decide whether the cyclability of $G$ is at least $k,$ is {\sf NP}-hard. We study the parametrized complexity of this problem.
Golovach, Petr A. +3 more
openaire +7 more sources
Relativization and interactive proof systems in Parameterized Complexity theory [PDF]
, 2017 We introduce some classical complexity-theoretic techniques to Parameterized Complexity. First, we study relativization for the machine models that were used by Chen, Flum, and Grohe (2005) to characterize a number of parameterized complexity classes ...
Bottesch, Ralph, Bottesch, R.C. (Ralph)
core +1 more source
Towards exact structural thresholds for parameterized complexity [PDF]
, 2022 Parameterized complexity seeks to use input structure to obtain faster algorithms for NP-hard problems. This has been most successful for graphs of low treewidth: Many problems admit fast algorithms relative to treewidth and many of them are optimal ...
Hegerfeld, Falko, Kratsch, Stefan
core +1 more source
The Parameterized Complexity of the Equidomination Problem [PDF]
, 2017 A graph $G=(V,E)$ is called equidominating if there exists a value $t \in \mathbb{N}$ and a weight function $ω: V \rightarrow \mathbb{N}$ such that the total weight of a subset $D\subseteq V$ is equal to $t$ if and only if $D$ is a minimal dominating set.
Oliver Schaudt, Fabian Senger
openaire +3 more sources
‘Guide and Prejudice’— How Argonautes recognize targets across domains of life
FEBS Letters, EarlyView.Argonaute proteins use short nucleic‐acid guides to locate and regulate specific targets across all domains of life. Despite striking diversity—from human gene silencing to bacterial immune defence—all Argonautes share a conserved three‐stage recognition logic: guide‐directed sampling, progressive target pairing with a conformational checkpoint and ...
Jack P. K. Bravo
wiley +1 more source
Model-Checking Parameterized Concurrent Programs Using Linear Interfaces [PDF]
, 2010 We consider the verification of parameterized Boolean programs— abstractions of shared-memory concurrent programs with an unbounded number of threads. We propose that such programs can be model-checked by iteratively considering the program under k-round
Salvatore La Torre +7 more
core +2 more sources