On the Size of Minimal Separators for Treedepth Decomposition [PDF]
We give a conjecture that we still have an optimal treedepth decomposition even we use only minimal separators no larger than the treewidth of input graphs. Then, we give some theoretical results for the conjecture.
Zijian Xu, Vorapong Suppakitpaisarn
semanticscholar +3 more sources
Sallow: a heuristic algorithm for treedepth decompositions [PDF]
We describe a heuristic algorithm for computing treedepth decompositions, submitted for the PACE 2020 challenge. It relies on a variety of greedy algorithms computing elimination orderings, as well as a Divide & Conquer approach on balanced cuts obtained
Marcin Wrochna
semanticscholar +6 more sources
SAT-Encodings for Treecut Width and Treedepth [PDF]
The decomposition of graphs is a prominent algorithmic task with numerous applications in computer science. A graph decomposition method is typically associated with a width parameter (such as treewidth) that indicates how well the given graph can be ...
R. Ganian +3 more
semanticscholar +6 more sources
Parameterized Algorithms for MILPs with Small Treedepth [PDF]
Solving (mixed) integer (linear) programs, (M)I(L)Ps for short, is a fundamental optimisation task with a wide range of applications in artificial intelligence and computer science in general.
Cornelius Brand +2 more
semanticscholar +4 more sources
Clustered colouring of graph classes with bounded treedepth or pathwidth [PDF]
The "clustered chromatic number" of a class of graphs is the minimum integer $k$ such that for some integer $c$ every graph in the class is $k$-colourable with monochromatic components of size at most $c$.
S. Norin, A. Scott, D. Wood
semanticscholar +3 more sources
Polynomial Treedepth Bounds in Linear Colorings [PDF]
Low-treedepth colorings are an important tool for algorithms that exploit structure in classes of bounded expansion; they guarantee subgraphs that use few colors have bounded treedepth.
Jeremy Kun +3 more
semanticscholar +6 more sources
Memory Versus Expectation: Processing Relative Clauses in a Flexible Word Order Language. [PDF]
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
Brain dopamine receptor system is not altered in obesity: Bayesian and frequentist meta-analyses. [PDF]
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
Family Income Is Associated With Regional Brain Glucose Metabolism in Middle-Aged Males. [PDF]
ABSTRACT Socioeconomic status is a multifaceted construct that plays a prominent role in shaping our environment. This study investigated the associations between family income, education level, and brain glucose metabolism in middle‐aged males. We retrospectively analysed data of healthy males who underwent a health check‐up programme including (1 ...
Pak K +6 more
europepmc +2 more sources
Personalized Nutrition Recommendations Using a Bayesian Mixture Model of Concentration Constraints and Intake Preferences. [PDF]
ABSTRACT Maintaining proper nutrition is crucial for preserving health and preventing disease. However, what constitutes proper nutrition may vary among individuals; evidence indicates that the effects of diet and even single nutrients can differ considerably because of personal characteristics.
Turkia J, Schwab U, Hautamäki V.
europepmc +2 more sources

