Results 1 to 10 of about 13,814 (224)
Treewidth-based algorithms for the small parsimony problem on networks. [PDF]
Algorithms Mol Biol, 2022 Phylogenetic reconstruction is one of the paramount challenges of contemporary bioinformatics. A subtask of existing tree reconstruction algorithms is modeled by the Small Parsimony problem: given a tree T and an assignment of character-states to its ...
Scornavacca C, Weller M.
europepmc +2 more sources
An Improved Parameterized Algorithm for Treewidth [PDF]
SIAM Journal on 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 +3 more sources
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
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
Tight Algorithms for Connectivity Problems Parameterized by Modular-Treewidth [PDF]
International Workshop on Graph-Theoretic Concepts in Computer Science, 2023 We study connectivity problems from a fine-grained parameterized perspective. Cygan et al. (TALG 2022) obtained algorithms with single-exponential running time $\alpha^{tw} n^{O(1)}$ for connectivity problems parameterized by treewidth ($tw$) by ...
Falko Hegerfeld, Stefan Kratsch
semanticscholar +1 more source
A Single-Exponential Time 2-Approximation Algorithm for Treewidth [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2021 We give an algorithm, that given an n-vertex graph $G$ and an integer k, in time 2O(k)n either outputs a tree decomposition of $G$ of width at most 2k + 1 or determines that the treewidth of $G$ is larger than k.
T. Korhonen
semanticscholar +1 more source
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
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
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