Results 71 to 80 of about 4,776 (247)
On Low Treewidth Graphs and Supertrees [PDF]
Journal of Graph Algorithms and Applications, 2014 Compatibility of unrooted phylogenetic trees is a well studied problem in phylogenetics. It asks to determine whether for a set of k input trees T1,...,Tk there exists a larger tree (called a supertree) that contains the topologies of all k input trees. When any such supertree exists we call the instance compatible and otherwise incompatible.
Alexander Grigoriev +2 more
openaire +5 more sources
On Treewidth, Separators and Yao’s Garbling [PDF]
, 2021 We show that Yao’s garbling scheme is adaptively indistinguishable for the class of Boolean circuits of size \(S\) and treewidth \(w\) with only a \({S^{O({w})}}\) loss in security. For instance, circuits with constant treewidth are as a result adaptively indistinguishable with only a polynomial loss.
Kamath Hosdurg, Chethan +2 more
openaire +2 more sources
On Interval Routing Schemes and treewidth [PDF]
Information and Computation, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hans L. Bodlaender +5 more
openaire +4 more sources
Width, Depth, and Space: Tradeoffs between Branching and Dynamic Programming
Algorithms, 2018 Treedepth is a well-established width measure which has recently seen a resurgence of interest. Since graphs of bounded treedepth are more restricted than graphs of bounded tree- or pathwidth, we are interested in the algorithmic utility of this ...
Li-Hsuan Chen +3 more
doaj +1 more source
Decomposition-Guided Reductions for Argumentation and Treewidth
International Joint Conference on Artificial Intelligence, 2021 Argumentation is a widely applied framework for modeling and evaluating arguments and its reasoning with various applications. Popular frameworks are abstract argumentation (Dung’s framework) or logic-based argumentation (Besnard-Hunter’s framework ...
J. Fichte +3 more
semanticscholar +1 more source
On Light Spanners, Low-treewidth Embeddings and Efficient Traversing in Minor-free Graphs [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2020 Understanding the structure of minor-free metrics, namely shortest path metrics obtained over a weighted graph excluding a fixed minor, has been an important research direction since the fundamental work of Robertson and Seymour.
Vincent Cohen-Addad +3 more
semanticscholar +1 more source
Treewidth and pathwidth of permutation graphs [PDF]
SIAM Journal on Discrete Mathematics, 1993 This paper is the first one in a series of articles using scanlines in intersection models of graphs. The new concept enables to prove that every minimal triangulation of a permutation graph into a chordal graph is an interval graph, a result that generalizes to minimal triangulations of asteroidal-triple free graphs [Discrete Appl. Math.
Ton Kloks +2 more
openaire +5 more sources
Journal of Combinatorial Theory, Series B, 2018 The treewidth of a graph is an important invariant in structural and algorithmic graph theory. This paper studies the treewidth of line graphs. We show that determining the treewidth of the line graph of a graph $G$ is equivalent to determining the minimum vertex congestion of an embedding of $G$ into a tree.
Daniel J. Harvey, David R. Wood
openaire +3 more sources
The Treewidth of Java Programs
, 2002 Intuitively, the treewidth of a graph $G$ measures how close $G$ is to being a tree. The lower the treewidth, the faster we can solve various optimization problems on $G$, by dynamic programming along the tree structure. In the paper M.Thorup, All Structured |Programs have Small Tree-Width and Good Register Allocation [8] it is shown that the control ...
Gustedt, Jens +2 more
openaire +3 more sources
On Sparsification for Computing Treewidth [PDF]
Algorithmica, 2013 21 pages.
openaire +6 more sources