Results 21 to 30 of about 4,791 (239)
Planar and Minor-Free Metrics Embed into Metrics of Polylogarithmic Treewidth with Expected Multiplicative Distortion Arbitrarily Close to 1* [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2023 We prove that there is a randomized polynomialtime algorithm that given an edge-weighted graph G excluding a fixed-minor Q on n vertices and an accuracy parameter $\varepsilon\gt$ 0, constructs an edge-weighted graph H and an embedding $\eta: V(G ...
Vincent Cohen-Addad +3 more
semanticscholar +1 more source
A Faster Small Treewidth SDP Solver [PDF]
arXiv.org, 2022 Semidefinite programming is a fundamental tool in optimization and theoretical computer science. It has been extensively used as a black-box for solving many problems, such as embedding, complexity, learning, and discrepancy.
Yuzhou Gu, Zhao Song
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
An Improved Parameterized Algorithm for Treewidth [PDF]
Symposium on the Theory of Computing, 2022 We give an algorithm that takes as input an n-vertex graph G and an integer k, runs in time 2O(k2) nO(1), and outputs a tree decomposition of G of width at most k, if such a decomposition exists.
T. Korhonen, D. Lokshtanov
semanticscholar +1 more source
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 ...
Koster,Arie M.C.A. +2 more
openaire +8 more sources
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
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
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
Metric Dimension Parameterized By Treewidth [PDF]
Algorithmica, 2021 AbstractA resolving set S of a graph G is a subset of its vertices such that no two vertices of G have the same distance vector to S. The Metric Dimension problem asks for a resolving set of minimum size, and in its decision form, a resolving set of size at most some specified integer.
Bonnet, Edouard, Purohit, Nidhi
openaire +7 more sources