Results 1 to 10 of about 14,736 (264)
Computing Treewidth on the GPU [PDF]
We present a parallel algorithm for computing the treewidth of a graph on a GPU. We implement this algorithm in OpenCL, and experimentally evaluate its performance. Our algorithm is based on an $O^*(2^{n})$-time algorithm that explores the elimination orderings of the graph using a Held-Karp like dynamic programming approach.
Tom C. van der Zanden +1 more
openalex +6 more sources
On the Number of Labeled Graphs of Bounded Treewidth
Julien Baste, Marc Noy, Ignasi Sau
openalex +2 more sources
An ontology-based knowledge graph for representing interactions involving RNA molecules. [PDF]
Cavalleri E +11 more
europepmc +1 more source
Sketched Representations and Orthogonal Planarity of Bounded Treewidth\n Graphs [PDF]
Emilio Di Giacomo +2 more
openalex +1 more source
Critical assessment of synthetic accessibility scores in computer-assisted synthesis planning. [PDF]
Skoraczyński G +3 more
europepmc +1 more source
Approximating Sparsest Cut in Graphs of Bounded Treewidth [PDF]
Eden Chlamtáč +2 more
openalex +1 more source
Intrinsic linking of chromatin fiber in human cells
Borodzik M +8 more
europepmc +1 more source
Graph colorings with restricted bicolored subgraphs: I. Acyclic, star, and treewidth colorings
Bradshaw, Peter
openalex +1 more source

