Results 1 to 10 of about 82 (76)
Recent Advances in Positive-Instance Driven Graph Searching
Algorithms, 2022 Research on the similarity of a graph to being a tree—called the treewidth of the graph—has seen an enormous rise within the last decade, but a practically fast algorithm for this task has been discovered only recently by Tamaki (ESA 2017).
Max Bannach, Sebastian Berndt
doaj +1 more source
DynASP2.5: Dynamic Programming on Tree Decompositions in Action
Algorithms, 2021 Efficient exact parameterized algorithms are an active research area. Such algorithms exhibit a broad interest in the theoretical community. In the last few years, implementations for computing various parameters (parameter detection) have been ...
Johannes K. Fichte +3 more
doaj +1 more source
Width, Depth, and Space: Tradeoffs between Branching and Dynamic Programming
Algorithms, 2018 Treedepth is a well-established width measure which has recently seen a resurgence of interest. Since graphs of bounded treedepth are more restricted than graphs of bounded tree- or pathwidth, we are interested in the algorithmic utility of this ...
Li-Hsuan Chen +3 more
doaj +1 more source
Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Survey
Algorithms, 2019 Integer Linear Programming (ILP) is among the most successful and general paradigms for solving computationally intractable optimization problems in computer science.
Robert Ganian, Sebastian Ordyniak
doaj +1 more source
Game Comonads & Generalised Quantifiers [PDF]
Logical Methods in Computer ScienceGame comonads, introduced by Abramsky, Dawar and Wang and developed by Abramsky and Shah, give an interesting categorical semantics to some Spoiler-Duplicator games that are common in finite model theory. In particular they expose connections between one-
Adam Ó Conghaile, Anuj Dawar
doaj +1 more source
Structural Parameterizations of the Biclique-Free Vertex Deletion Problem [PDF]
Discrete Mathematics & Theoretical Computer ScienceIn this work, we study the Biclique-Free Vertex Deletion problem: Given a graph $G$ and integers $k$ and $i \le j$, find a set of at most $k$ vertices that intersects every (not necessarily induced) biclique $K_{i, j}$ in $G$.
Lito Goldmann +2 more
doaj +1 more source
What does Chinese BERT learn about syntactic knowledge? [PDF]
PeerJ Comput Sci, 2023 Zheng J, Liu Y.
europepmc +1 more source
MetaBayesDTA: codeless Bayesian meta-analysis of test accuracy, with or without a gold standard. [PDF]
BMC Med Res Methodol, 2023 Cerullo E +5 more
europepmc +1 more source
Bayesian paired comparison with the bpcs package. [PDF]
Behav Res Methods, 2022 Issa Mattos D +2 more
europepmc +1 more source
Memory Versus Expectation: Processing Relative Clauses in a Flexible Word Order Language. [PDF]
Cogn Sci, 2023 Ronai E, Xiang M.
europepmc +1 more source