Results 111 to 120 of about 5,081 (203)

On treewidth and maximum cliques

International audienceWe construct classes of graphs that are variants of the so-called layered wheel . One of their key properties is that while the treewidth is bounded by a function of the clique number, the construction can be adjusted to make the ...
Trotignon, Nicolas, Chudnovsky, Maria
core   +1 more source

The Treewidth of Java Programs

, 2002
Intuitively, the treewidth of a graph $G$ measures how close $G$ is to being a tree. The lower the treewidth, the faster we can solve various optimization problems on $G$, by dynamic programming along the tree structure. In the paper M.Thorup, All Structured |Programs have Small Tree-Width and Good Register Allocation [8] it is shown that the control ...
Gustedt, Jens, Maehle, Ole A., Telle, Jan Arne   +2 more
openaire   +4 more sources

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

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

Treewidth: . . . Computations

, 2006
This paper gives a short survey on algorithmic aspects of the treewidth of graphs. Some alternative characterizations and some applications of the notion are given.
Hans L. Bodlaender
core  

Attractor detection and enumeration algorithms for Boolean networks. [PDF]

Comput Struct Biotechnol J, 2022
Mori T, Akutsu T.
europepmc   +1 more source

Non-Preemptive Tree Packing. [PDF]

Algorithmica, 2023
Lendl S, Woeginger G, Wulf L.
europepmc   +1 more source

Characterizing width two for variants of treewidth

, 2014
In this paper, we consider the notion of \emph{special treewidth}, recently introduced by Courcelle\cite{Courcelle2012}. In a special tree decomposition, for each vertex $v$ in a given graph, the bags containing $v$ form a rooted path.
Kreuzen, VJC, Ok, Seongmin, Kwon, O-joung, Kratsch, Stefan, Bodlaender, HL Hans   +4 more
core  

A Note on Domino Treewidth [PDF]

, 1998
In [3], Bodlaender and Engelfriet proved that for every k, and d, there exists a constant c k;d , such that every graph with treewidth at most k and maximum degree at most d has domino treewidth at most c k;d .
Hans Bodlaender, Bodlaender, H.L., Dep Informatica, Algoritmische Systemen   +3 more
core  

Causal Unit Selection using Tractable Arithmetic Circuits

Proceedings of the International Florida Artificial Intelligence Research Society Conference
The unit selection problem aims to find objects, called units, that optimize a causal objective function which describes the objects' behavior in a causal context (e.g., selecting customers who are about to churn but would most likely change their mind ...
Haiying Huang, Adnan Darwiche
doaj   +1 more source

Faster algorithms for counting subgraphs in sparse graphs. [PDF]

Algorithmica, 2021
Bressan M.
europepmc   +1 more source