ToTo: An open database for computation, storage and retrieval of tree decompositions

详细信息    查看全文

• 作者：Rim van Wersch ; ^{rim@treedecompositions.com} ; Steven Kelk ; ^{steven.kelk@maastrichtuniversity.nl}
• 关键词：Treewidth ; Tree decomposition ; Graphs ; Database ; Algorithms
• 刊名：Discrete Applied Mathematics
• 出版年：2017
• 出版时间：30 January 2017
• 年：2017
• 卷：217
• 期：part_P3
• 页码：389-393
• 全文大小：889 K
• 卷排序：217

文摘

Many NP-hard problems on graphs become tractable on graphs of low treewidth, but the corresponding algorithms require access to a tree decomposition of the graph of low (ideally, minimum) width. Unfortunately computation of treewidth is itself NP-hard and a wide variety of exact, heuristic and approximation algorithms have been proposed for this problem. To support this ongoing research we present here ToTo, an open graph database for computation, storage and rapid retrieval of tree decompositions. We hope that the database will become both a central repository for important graphs and benchmark datasets and extend the use of treewidth beyond the usual communities: the database and associated algorithms can be accessed via a web browser and do not require installation of any specialist software.