Results 151 to 160 of about 13,679 (262)
Finding shortest non-trivial cycles in directed graphs on surfaces
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+2 more
doaj +1 more source
Minimum Fill-In and Treewidth for Graphs Modularly Decomposable into Chordal Graphs [PDF]
Elias Dahlhaus
openalex +1 more source
The Pebble-Relation Comonad in Finite Model Theory [PDF]
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
The treewidth and pathwidth of hypercubes
AbstractThe d-dimensional hypercube, Hd, is the graph on 2d vertices, which correspond to the 2d d-vectors whose components are either 0 or 1, two of the vertices being adjacent when they differ in just one coordinate. The notion of Hamming graphs (denoted by Kqd) generalizes the notion of hypercubes: The vertices correspond to the qd d-vectors where ...
L. Sunil Chandran, Telikepalli Kavitha
openaire +2 more sources
Treewidth and Minimum Fill-in on d-Trapezoid Graphs [PDF]
Hans L. Bodlaender+3 more
openalex +1 more source
Heuristic and metaheuristic methods for computing graph treewidth [PDF]
François Clautiaux+3 more
openalex +1 more source
On the Maximum Cardinality Search Lower Bound for Treewidth [PDF]
Hans L. Bodlaender, Arie M. C. A. Koster
openalex +1 more source
Treewidth-aware reductions of normal ASP to SAT - Is normal ASP harder than SAT after all? [PDF]
Markus Hecher
semanticscholar +1 more source
Attractor detection and enumeration algorithms for Boolean networks. [PDF]
Mori T, Akutsu T.
europepmc +1 more source
Special Issue Dedicated to the 16th International Symposium on Parameterized and Exact Computation. [PDF]
Golovach PA, Zehavi M.
europepmc +1 more source