Results 51 to 60 of about 467 (123)
Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related Parameters
, 2022 We investigate the parameterized complexity of Binary CSP parameterized by the vertex cover number and the treedepth of the constraint graph, as well as by a selection of related modulator-based parameters. The main findings are as follows: i) Binary CSP parameterized by the vertex cover number is $\mathrm{W}[3]$-complete.
Bodlaender, Hans L. +2 more
openaire +6 more sources
, 2020 This is a submission to the 2020 PACE challenge, Exact Tract: Computing treedepth decompositions of minimum width Submission by: Tom C. van der Zanden (Maastricht University) The solver is a basic one which computes decompositions bottom-up, in a ...
Tom C. van der Zanden
core +1 more source
Weighted Treedepth is NP-complete on Graphs of Bounded Degree
CoRRA treedepth decomposition of an undirected graph $G$ is a rooted forest $F$ on the vertex set of $G$ such that every edge $uv\in E(G)$ is in ancestor-descendant relationship in $F$. Given a weight function $w\colon V(G)\rightarrow \mathbb{N}$, the weighted depth of a treedepth decomposition is the maximum weight of any path from the root to a leaf ...
Jona Dirks +3 more
openaire +3 more sources
Reconfiguration in bounded bandwidth and tree-depth [PDF]
Journal of Computer and System Sciences, 2018 We show that several reconfiguration problems known to be PSPACE-complete remain so even when limited to graphs of bounded bandwidth. The essential step is noticing the similarity to very limited string rewriting systems, whose ability to directly simulate Turing Machines is classically known.
openaire +6 more sources
Computing Twin-Width via Treedepth and Vertex Integrity
A short version of this preprint appeared at STACS ...
Ganian, Robert, Rocton, Mathis
openaire +4 more sources
PACE Solver Description: Computing Exact Treedepth via Minimal Separators.
, 2020 This is a description of team xuzijian629’s treedepth solver submitted to PACE 2020. As we use a top-down approach, we enumerate all possible minimal separators at each step. The enumeration is sped up by several novel pruning techniques and is based on our conjecture that we can always have an optimal decomposition without using separators with size ...
Xu, Zijian +2 more
openaire +3 more sources
MetaBayesDTA: codeless Bayesian meta-analysis of test accuracy, with or without a gold standard. [PDF]
BMC Med Res Methodol, 2023 Cerullo E +5 more
europepmc +1 more source
Bayesian paired comparison with the bpcs package. [PDF]
Behav Res Methods, 2022 Issa Mattos D +2 more
europepmc +1 more source
How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs?
, 2019 International audienceIn the last years, kernelization with structural parameters has been an active area of research within the eld of parameterized complexity. As a relevant example, Gajarský et al. [ESA 2013] proved that every graph problem satisfying
Bougeret, Marin +2 more
core +1 more source
A faster polynomial-space algorithm for Hamiltonian cycle parameterized by treedepth
CoRRA large number of NP-hard graph problems can be solved in $f(w)n^{O(1)}$ time and space when the input graph is provided together with a tree decomposition of width $w$, in many cases with a modest exponential dependence $f(w)$ on $w$. Moreover, assuming the Strong Exponential-Time Hypothesis (SETH) we have essentially matching lower bounds for many ...
openaire +2 more sources