Results 11 to 20 of about 278 (179)
On the treewidths of graphs of bounded degree. [PDF]
PLoS ONE, 2015 In this paper, we develop a new technique to study the treewidth of graphs with bounded degree. We show that the treewidth of a graph G = (V, E) with maximum vertex degree d is at most [Formula: see text] for sufficiently large d, where C is a constant.
Yinglei Song, Menghong Yu
doaj +1 more source
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2023 80 pages, 2 ...
Tuukka Korhonen +4 more
openaire +2 more sources
Treewidth: Computational Experiments [PDF]
Electronic Notes in Discrete Mathematics, 2001 Many N/P-hard graph problems can be solved in polynomial time for graphs with bounded treewidth. Equivalent results are known for pathwidth and branchwidth. In recent years, several studies have shown that this result is not only of theoretical interest but can successfully be applied to find (almost) optimal solutions or lower bounds for many ...
Arie M. C. A. Koster +2 more
openaire +8 more sources
Extension Complexity, MSO Logic, and Treewidth [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 We consider the convex hull $P_{\varphi}(G)$ of all satisfying assignments of a given MSO formula $\varphi$ on a given graph $G$. We show that there exists an extended formulation of the polytope $P_{\varphi}(G)$ that can be described by $f(|\varphi ...
Petr Kolman +2 more
doaj +1 more source
Answer Counting under Guarded TGDs [PDF]
Logical Methods in Computer Science, 2023 We study the complexity of answer counting for ontology-mediated queries and for querying under constraints, considering conjunctive queries and unions thereof (UCQs) as the query language and guarded TGDs as the ontology and constraint language ...
Cristina Feier +2 more
doaj +1 more source
On treewidth approximations [PDF]
Electronic Notes in Discrete Mathematics, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vincent Bouchitté +3 more
openaire +3 more sources
Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity [PDF]
Logical Methods in Computer Science, 2019 This paper settles the computational complexity of model checking of several extensions of the monadic second order (MSO) logic on two classes of graphs: graphs of bounded treewidth and graphs of bounded neighborhood diversity.
Dušan Knop +3 more
doaj +1 more source
On the Treewidth of Dynamic Graphs [PDF]
Theoretical Computer Science, 2013 Dynamic graph theory is a novel, growing area that deals with graphs that change over time and is of great utility in modelling modern wireless, mobile and dynamic environments. As a graph evolves, possibly arbitrarily, it is challenging to identify the graph properties that can be preserved over time and understand their respective computability.
Bernard Mans, Luke Mathieson
openaire +3 more sources
Time and Parallelizability Results for Parity Games with Bounded Tree and DAG Width [PDF]
Logical Methods in Computer Science, 2013 Parity games are a much researched class of games in NP intersect CoNP that are not known to be in P. Consequently, researchers have considered specialised algorithms for the case where certain graph parameters are small.
John Fearnley, Sven Schewe
doaj +1 more source
Patterns with Bounded Treewidth [PDF]
Information and Computation, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Daniel Reidenbach, Markus L. Schmid
openaire +2 more sources