Results 11 to 20 of about 306 (178)
Journal of Graph Algorithms and ApplicationsA witness drawing of a graph is a visualization that clearly shows a given property of a graph. We study and implement various drawing paradigms for witness drawings to clearly show that graphs have bounded pathwidth or treewidth. Our approach draws the
Alvin Chiu +4 more
doaj +4 more sources
An Improvement of Reed’s Treewidth Approximation [PDF]
Journal of Graph Algorithms and Applications, 2022 We present a new approximation algorithm for the treewidth problem which finds an upper bound on the treewidth and constructs a corresponding tree decomposition as well. Our algorithm is a faster variation of Reed's classical algorithm.
Mahdi Belbasi, Martin Fürer
doaj +3 more sources
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
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
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
Constrained Connectivity in Bounded X-Width Multi-Interface Networks
Algorithms, 2020 As technology advances and the spreading of wireless devices grows, the establishment of interconnection networks is becoming crucial. Main activities that involve most of the people concern retrieving and sharing information from everywhere.
Alessandro Aloisio, Alfredo Navarra
doaj +1 more source
Quantum speedups for treewidth
CoRR, 2022 In this paper, we study quantum algorithms for computing the exact value of the treewidth of a graph. Our algorithms are based on the classical algorithm by Fomin and Villanger (Combinatorica 32, 2012) that uses $O(2.616^n)$ time and polynomial space. We show three quantum algorithms with the following complexity, using QRAM in both exponential space ...
Kļevickis, Vladislavs +2 more
openaire +4 more sources
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
On the treewidth of Hanoi graphs
Theoretical Computer Science, 2022 The objective of the well-known Towers of Hanoi puzzle is to move a set of disks one at a time from one of a set of pegs to another, while keeping the disks sorted on each peg. We propose an adversarial variation in which the first player forbids a set of states in the puzzle, and the second player must then convert one randomly-selected state to ...
David Eppstein +2 more
openaire +4 more sources