Results 111 to 120 of about 1,490 (139)

The successor representation subserves hierarchical abstraction for goal-directed behavior. [PDF]

PLoS Comput Biol
Wientjes S, Holroyd CB.
europepmc   +1 more source

Counting Linear Extensions: Parameterizations by Treewidth. [PDF]

Algorithmica, 2019
Eiben E, Ganian R, Kangas K, Ordyniak S.
europepmc   +1 more source

Model Comparison for Breast Cancer Prognosis Based on Clinical Data. [PDF]

PLoS One, 2016
Boughorbel S, Al-Ali R, Elkum N.
europepmc   +1 more source

The Seven-parameter Diffusion Model: an Implementation in Stan for Bayesian Analyses. [PDF]

Behav Res Methods
Henrich F, Hartmann R, Pratz V, Voss A, Klauer KC.   +4 more
europepmc   +1 more source

A tutorial for estimating Bayesian hierarchical mixture models for visual working memory tasks: Introducing the Bayesian Measurement Modeling (bmm) package for R. [PDF]

Behav Res Methods
Frischkorn GT, Popov V.
europepmc   +1 more source

The impact of kinship composition on social structure

Pereira AS, Pavez-Fox MA, Hart JDA, Negron-Del Valle JE, Phillips D, Casanova C, De Moor D, Brent LJN.   +7 more
europepmc   +1 more source

Treedepth vs Circumference

Combinatorica, 2023
The circumference of a graph $G$ is the length of a longest cycle in $G$, or $+\infty$ if $G$ has no cycle. Birmelé (2003) showed that the treewidth of a graph $G$ is at most its circumference minus $1$. We strengthen this result for $2$-connected graphs as follows: If $G$ is $2$-connected, then its treedepth is at most its circumference.
Marcin Briański
exaly   +6 more sources