Results 211 to 220 of about 4,791 (239)
On Compiling Structured CNFs to OBDDs. [PDF]
Theory Comput Syst, 2017 Bova S, Slivovsky F.
europepmc +1 more source
An alternative characterisation of graphs quasi-isometric to graphs of bounded treewidth
Marc Distel
openalex +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Journal of Algorithms, 1997
Summary: We consider a special variant of tree-decompositions, called domino tree-decompositions, and the related notion of domino treewidth. In a domino tree- decomposition, each vertex of the graph belongs to at most two nodes of the tree. We prove that for every \(k\), \(d\), there exists a constant \(c_{k,d}\) such that a graph with treewidth at ...
Bodlaender, Hans, Engelfriet, Joost
openaire +3 more sources
Summary: We consider a special variant of tree-decompositions, called domino tree-decompositions, and the related notion of domino treewidth. In a domino tree- decomposition, each vertex of the graph belongs to at most two nodes of the tree. We prove that for every \(k\), \(d\), there exists a constant \(c_{k,d}\) such that a graph with treewidth at ...
Bodlaender, Hans, Engelfriet, Joost
openaire +3 more sources
Bounding twin-width for bounded-treewidth graphs, planar graphs, and bipartite graphs
International Workshop on Graph-Theoretic Concepts in Computer Science, 2022Twin-width is a newly introduced graph width parameter that aims at generalizing a wide range of"nicely structured"graph classes. In this work, we focus on obtaining good bounds on twin-width $\text{tww}(G)$ for graphs $G$ from a number of classic graph ...
Hugo Jacob, Marcin Pilipczuk
semanticscholar +1 more source
Hedonic Games and Treewidth Revisited
Embedded Systems and Applications, 2022We revisit the complexity of the well-studied notion of Additively Separable Hedonic Games (ASHGs). Such games model a basic clustering or coalition formation scenario in which selfish agents are represented by the vertices of an edge-weighted digraph $G=
T. Hanaka, M. Lampis
semanticscholar +1 more source
Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts
International Workshop on Graph-Theoretic Concepts in Computer Science, 2022Decompositional parameters such as treewidth are commonly used to obtain fixed-parameter algorithms for NP-hard graph problems. For problems that are W[1]-hard parameterized by treewidth, a natural alternative would be to use a suitable analogue of ...
Cornelius Brand +4 more
semanticscholar +1 more source