Results 21 to 30 of about 467 (123)
SAT-Encodings for Treecut Width and Treedepth [PDF]
, 2019 In this paper we propose, implement, and test the first practical decomposition algorithms for the width parameters treecut width and treedepth. These two parameters have recently gained a lot of attention in the theoretical research community as they offer the algorithmic advantage over treewidth by supporting so-called fixed-parameter algorithms for ...
Robert Ganian +3 more
openaire +6 more sources
DAIA: a decompose and improve algorithm for treedepth decomposition
, 2020 DAIA is a two-phases heuristic algorithm that searches for good treedepth decompositions of graphs. First it builds a treedepth decomposition partitionning recursively the vertices. Then it modifies the resulting tree in order to reduce its height.
Stéphane Grandcolas +1 more
openaire +2 more sources
Treedepth Parameterized by Vertex Cover Number. [PDF]
, 2017 To solve hard graph problems from the parameterized perspective, structural parameters have commonly been used. In particular, vertex cover number is frequently used in this context. In this paper, we study the problem of computing the treedepth of a given graph G.
Yasuaki Kobayashi, Hisao Tamaki
openaire +4 more sources
PACE Solver Description: Bute-Plus: A Bottom-Up Exact Solver for Treedepth [PDF]
, 2020 This note introduces Bute-Plus, an exact solver for the treedepth problem. The core of the solver is a positive-instance driven dynamic program that constructs an elimination tree of minimum depth in a bottom-up fashion. Three features greatly improve the algorithm's run time. The first of these is a specialised trie data structure.
Trimble, James
openaire +5 more sources
The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. [PDF]
, 2020 This year’s Parameterized Algorithms and Computational Experiments challenge (PACE 2020) was devoted to the problem of computing the treedepth of a given graph. Altogether 51 participants from 20 teams, 12 countries and 3 continents submitted their implementations to the competition. In this report, we describe the setup of the challenge, the selection
Lukasz Kowalik +5 more
openaire +5 more sources
Solving connectivity problems parameterized by treedepth in single-exponential time and polynomial space [PDF]
CoRR, 2020 A breakthrough result of Cygan et al. (FOCS 2011) showed that connectivity problems parameterized by treewidth can be solved much faster than the previously best known time $\mathcal{O}^*(2^{\mathcal{O}(tw \log(tw))})$. Using their inspired Cut\&Count technique, they obtained $\mathcal{O}^*(α^{tw})$ time algorithms for many such problems. Moreover,
Falko Hegerfeld, Stefan Kratsch
openaire +5 more sources
Memory Versus Expectation: Processing Relative Clauses in a Flexible Word Order Language. [PDF]
Cogn Sci, 2023 Abstract Memory limitations and probabilistic expectations are two key factors that have been posited to play a role in the incremental processing of natural language. Relative clauses (RCs) have long served as a key proving ground for such theories of language processing. Across three self‐paced reading experiments, we test the online comprehension of
Ronai E, Xiang M.
europepmc +2 more sources
Estimation of Underlying Normal Distribution Parameters From Dichotomized Data. [PDF]
Biom JABSTRACT Accurately estimating the parameters of a continuous distribution from dichotomized or aggregated data is a common problem in biomedical and environmental research. Many studies report only the proportion of subjects exceeding a threshold, without releasing individual‐level measurements.
Liu Z +4 more
europepmc +2 more sources
Brain dopamine receptor system is not altered in obesity: Bayesian and frequentist meta-analyses. [PDF]
Hum Brain Mapp, 2023 Brain dopamine receptor availability is not different between lean and overweight/obese subjects according to both Bayesian and frequentist meta‐analyses. However, the effect is dependent on the radiopharmaceutical and the degree of obesity. Abstract Feeding induces dopamine release in the striatum, and a dysfunction of the dopaminergic reward system ...
Pak K, Nummenmaa L.
europepmc +2 more sources
Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related Parameters [PDF]
ICALP, 2023 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.
Pilipczuk, Michał +2 more
openaire +2 more sources