Results 131 to 140 of about 11,505 (254)
(Sub)Fall Coloring and B-Coloring Parameterized by Treewidth
, 2022 Davi de Andrade, Ana Silva
openalex +2 more sources
The treewidth and pathwidth of hypercubes
Discrete Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
L. Sunil Chandran, Telikepalli Kavitha
openaire +1 more source
Causal Unit Selection using Tractable Arithmetic Circuits
Proceedings of the International Florida Artificial Intelligence Research Society ConferenceThe 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
Speeding-up Dynamic Programming with Representative Sets - An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions [PDF]
, 2013 Dynamic programming on tree decompositions is a frequently used approach to solve otherwise intractable problems on instances of small treewidth.
Bodlaender, Hans L. +2 more
core
Product structure of graph classes with bounded treewidth [PDF]
, 2022 Rutger Campbell +10 more
openalex +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 +2 more
openaire +3 more sources
On the treewidth of triangulated 3-manifolds
CoRR, 2017 In graph theory, as well as in 3-manifold topology, there exist several width-type parameters to describe how "simple" or "thin" a given graph or 3-manifold is. These parameters, such as pathwidth or treewidth for graphs, or the concept of thin position for 3-manifolds, play an important role when studying algorithmic problems; in particular, there is ...
Kristóf Huszár +2 more
openaire +4 more sources
The algorithmic theory of treewidth
Electronic Notes in Discrete Mathematics, 2000 Abstract Treewidth is a graph measure with several applications. In this abstract, it is discussed that many otherwise intractable problems become polynomial or linear time solvable when restricted to graphs of bounded treewidth, and some other algorithmic results that use treewidth (e.g., applied to planar graphs) are discussed.
openaire +1 more source
Graph Isomorphism in Quasipolynomial Time Parameterized by Treewidth
, 2020 Daniel Wiebking
openalex +2 more sources
The $k$-path coloring problem in graphs with bounded treewidth: an\n application in integrated circuit manufacturing [PDF]
, 2019 Dehia Ait-Ferhat +3 more
openalex +1 more source