Results 11 to 20 of about 5,081 (203)
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 +5 more sources
, 2005 Treewidth is a graph parameter with several interesting theoretical and practical applications. This survey reviews algorithmic results on determining the treewidth of a given graph, and finding a tree decomposition of small width. Both theoretical results, establishing the asymptotic computational complexity of the problem, as experimental work on ...
Hans L. Bodlaender, Bodlaender, H.L.
openaire +6 more sources
The treewidth of smart contracts [PDF]
Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing, 2019 Smart contracts are programs that are stored and executed on the Blockchain and can receive, manage and transfer money in the form of cryptocurrency units. Two important problems regarding smart contracts are formal analysis and compiler optimization. Formal analysis is extremely important, because smart contracts hold funds worth billions of dollars ...
Krishnendu Chatterjee +2 more
openaire +5 more sources
Information and Computation, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Moritz Müller, Stefan Szeider
core +5 more sources
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 +5 more sources
, 1993 This thesis focuses on problems related to treewidth and pathwidth of graphs. Many problems are difficult to solve for graphs in general. The treewidth of a graph is a good indication whether one can obtain a solution within reasonable time. A necessary ingredient is a treedecomposition of the graph with small width.
Kloks, A.J.J.
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 +9 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 +6 more sources
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2023 80 pages, 2 ...
Tuukka Korhonen +4 more
openaire +4 more sources
Patterns with Bounded Treewidth [PDF]
Information and Computation, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Daniel Reidenbach, Markus L. Schmid
openaire +4 more sources