Results 21 to 30 of about 4,776 (247)
Metric dimension parameterized by treewidth in chordal graphs [PDF]
International Workshop on Graph-Theoretic Concepts in Computer Science, 2023 The metric dimension has been introduced independently by Harary, Melter and Slater in 1975 to identify vertices of a graph G using its distances to a subset of vertices of G.
N. Bousquet +2 more
semanticscholar +1 more source
Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure [PDF]
J. Comb. Theory B, 2022 We continue the study of $(\mathrm{tw},\omega)$-bounded graph classes, that is, hereditary graph classes in which the treewidth can only be large due to the presence of a large clique, with the goal of understanding the extent to which this property has ...
Clément Dallard +2 more
semanticscholar +1 more source
Product structure of graph classes with bounded treewidth [PDF]
Combinatorics, probability & computing, 2022 We show that many graphs with bounded treewidth can be described as subgraphs of the strong product of a graph with smaller treewidth and a bounded-size complete graph.
Rutger Campbell +10 more
semanticscholar +1 more source
Low Treewidth Embeddings of Planar and Minor-Free Metrics [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2022 Cohen-Addad, Filtser, Klein and Le [FOCS’20] constructed a stochastic embedding of minor-free graphs of diameter D into graphs of treewidth $O_{\epsilon}(\log n)$ with expected additive distortion $+\epsilon D$. Cohen-Addad et al. then used the embedding
Arnold Filtser, Hung Le
semanticscholar +1 more source
ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2023 The core chase, a popular algorithm for answering conjunctive queries (CQs) over existential rules, is guaranteed to terminate and compute a finite universal model whenever one exists, leading to the equivalence of the universal-model-based and the chase-
Jean-François Baget +2 more
semanticscholar +1 more source
On treewidth approximations [PDF]
Electronic Notes in Discrete Mathematics, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bouchitté, Vincent +3 more
openaire +5 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
Treewidth, Circle Graphs, and Circular Drawings [PDF]
SIAM Journal on Discrete Mathematics, 2022 A circle graph is an intersection graph of a set of chords of a circle. We describe the unavoidable induced subgraphs of circle graphs with large treewidth. This includes examples that are far from the `usual suspects'.
Robert Hickingbotham +3 more
semanticscholar +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
Twin-width can be exponential in treewidth [PDF]
J. Comb. Theory B, 2022 For any small positive real $\varepsilon$ and integer $t>\frac{1}{\varepsilon}$, we build a graph with a vertex deletion set of size $t$ to a tree, and twin-width greater than $2^{(1-\varepsilon) t}$.
Édouard Bonnet, Hugues Déprés
semanticscholar +1 more source