Results 1 to 10 of about 467 (123)

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

Parameterized Algorithms for Queue Layouts

Journal of Graph Algorithms and Applications, 2022
An $h$-queue layout of a graph $G$ consists of a linear order of its vertices and a partition of its edges into $h$ sets, called queues, such that no two independent edges of the same queue nest.
Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, Martin Nöllenburg   +3 more
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, Markus Hecher, Michael Morak, Stefan Woltran   +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, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil   +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 Science
Game 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 Science
In 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, Leon Kellerhals, Tomohiro Koana   +2 more
doaj   +1 more source

On the Complexity of Embedding in Graph Products

Computing in Geometry and Topology
Graph embedding, especially as a subgraph of a grid, is an old topic in VLSI design and graph drawing. In this paper, we investigate related questions concerning the complexity of embedding a graph G in a host graph that is the strong product of a path ...
Therese Biedl, David Eppstein, Torsten Ueckerdt   +2 more
doaj   +1 more source

Structural Parameterizations of $k$-Planarity

Journal of Graph Algorithms and Applications
The concept of $k$-planarity is extensively studied in the context of Beyond Planarity. A graph is $k$-planar if it admits a drawing in the plane in which each edge is crossed at most $k$ times.
Tatsuya Gima, Yasuaki Kobayashi, Yuto Okada   +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