Results 41 to 50 of about 364 (127)

Treedepth Parameterized by Vertex Cover Number.

open access: yes, 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   +3 more sources

About Treedepth and Related Notions

open access: yes, 2017
Dissertation, RWTH Aachen University, 2017; Aachen 1 Online-Ressource (getrennte Zählung) : Illustrationen (2017).
openaire   +2 more sources

Reconfiguration in bounded bandwidth and tree-depth [PDF]

open access: yesJournal 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   +4 more sources

MetaBayesDTA: codeless Bayesian meta-analysis of test accuracy, with or without a gold standard. [PDF]

open access: yesBMC Med Res Methodol, 2023
Cerullo E   +5 more
europepmc   +1 more source

Bayesian paired comparison with the bpcs package. [PDF]

open access: yesBehav Res Methods, 2022
Issa Mattos D   +2 more
europepmc   +1 more source

DAIA: a decompose and improve algorithm for treedepth decomposition

open access: yes, 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.
openaire   +1 more source

Sound garden: How snakes respond to airborne and groundborne sounds. [PDF]

open access: yesPLoS One, 2023
Zdenek CN   +4 more
europepmc   +1 more source

Bayesian analysis of phase data in EEG and MEG. [PDF]

open access: yesElife, 2023
Dimmock S, O'Donnell C, Houghton C.
europepmc   +1 more source

Home - About - Disclaimer - Privacy