Generic Programing for Graph Problems Using Tree Decompositions
نویسندگان
چکیده
vii
منابع مشابه
Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives algorithms that, for a graph, given with a tree decomposition of width k, solve the dominated set problem in O(nk3) time and the problem to count the number of perfect matchings in O∗(2k) time. Using a generalisation of fast subs...
متن کاملBranch and Tree Decomposition Techniques for Discrete Optimization
This chapter gives a general overview of two emerging techniques for discrete optimization that have footholds in mathematics, computer science, and operations research: branch decompositions and tree decompositions. Branch decompositions and tree decompositions along with their respective connectivity invariants, branchwidth and treewidth, were first introduced to aid in proving the Graph Mino...
متن کاملRanked Enumeration of Minimal Triangulations
Tree decompositions facilitate computations on complex graphs by grouping vertices into bags interconnected in an acyclic structure; hence their importance in a plethora of problems such as query evaluation over databases and inference over probabilistic graphical models. Different applications take varying benefits from different tree decompositions, and hence, measure them by diverse (sometim...
متن کاملTree Decomposition: A Feasibility Study
Graphs of small treewidth resemble a tree in a certain (precise) sense. Many computationally hard graph problems can be solved efficiently on graphs of small treewidth using a “tree decomposition,” which represents the constructive aspect of treewidth. However, computing minimum-width tree decompositions is NP-hard in general, but for fixed treewidth, there exist algorithms with polynomial runn...
متن کاملPlane Decompositions as Tools for Approximation
Tree decompositions were developed by Robertson and Seymour [21]. Since then algorithms have been developed to solve intractable problems efficiently for graphs of bounded treewidth. In this paper we extend tree decompositions to allow cycles to exist in the decomposition graph; we call these new decompositions plane decompositions because we require that the decomposition graph be planar. Firs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008