Results 111 to 120 of about 5,860 (222)

Finding shortest non-trivial cycles in directed graphs on surfaces

Journal of Computational Geometry, 2016
Let $D$ be a weighted directed graph cellularly embedded in a surface of genus $g$, orientable or not, possibly with boundary.  We describe algorithms to compute shortest non-contractible and shortest surface non-separating cycles in $D$, generalizing ...
Sergio Cabello, Éric Colin de Verdière, Francis Lazarus   +2 more
doaj   +1 more source

Combining Treewidth and Backdoors for CSP [PDF]

arXiv, 2016
We show that CSP is fixed-parameter tractable when parameterized by the treewidth of a backdoor into any tractable CSP problem over a finite constraint language. This result combines the two prominent approaches for achieving tractability for CSP: (i) by structural restrictions on the interaction between the variables and the constraints and (ii) by ...
arxiv  

Treewidth of Chordal Bipartite Graphs [PDF]

, 1995
Ton Kloks, Dieter Kratsch
openalex   +1 more source

Treewidth versus clique number. II. Tree-independence number [PDF]

J. Comb. Theory B, 2021
Clément Dallard, Martin Milanič, Kenny Štorgel   +2 more
semanticscholar   +1 more source

The Pebble-Relation Comonad in Finite Model Theory [PDF]

Logical Methods in Computer Science
The pebbling comonad, introduced by Abramsky, Dawar and Wang, provides a categorical interpretation for the k-pebble games from finite model theory.
Yoàv Montacute, Nihil Shah
doaj   +1 more source

Treewidth: Computational Experiments [PDF]

, 2001
Arie M. C. A. Koster, Hans L. Bodlaender, Stan P.M. van Hoesel   +2 more
openalex   +1 more source

Optimized 2-Approximation of Treewidth [PDF]

arXiv
This paper presents a linear FPT algorithm to find a tree decomposition with a 2-approximation of the treewidth with a significantly smaller exponential dependence on the treewidth in the running time than previously known.
arxiv  

Treewidth and Minimum Fill-in on d-Trapezoid Graphs [PDF]

, 2002
Hans L. Bodlaender, Ton Kloks, Dieter Kratsch, Haiko Müller   +3 more
openalex   +1 more source

Treewidth-aware reductions of normal ASP to SAT - Is normal ASP harder than SAT after all? [PDF]

Artificial Intelligence, 2021
Markus Hecher
semanticscholar   +1 more source

Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation. [PDF]

Algorithmica, 2022
Golovach PA, Zehavi M.
europepmc   +1 more source