Results 41 to 50 of about 364 (127)
Treedepth Parameterized by Vertex Cover Number.
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
What does Chinese BERT learn about syntactic knowledge? [PDF]
Zheng J, Liu Y.
europepmc +1 more source
About Treedepth and Related Notions
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]
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]
Cerullo E +5 more
europepmc +1 more source
Bayesian paired comparison with the bpcs package. [PDF]
Issa Mattos D +2 more
europepmc +1 more source
DAIA: a decompose and improve algorithm for treedepth decomposition
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]
Zdenek CN +4 more
europepmc +1 more source
Bayesian analysis of phase data in EEG and MEG. [PDF]
Dimmock S, O'Donnell C, Houghton C.
europepmc +1 more source
Bayesian Identification and Estimation of Growth Mixture Models. [PDF]
Xiao X, Rabe-Hesketh S, Skrondal A.
europepmc +1 more source

