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

Rim van Wersch, Steven Kelk

Research output: Contribution to journalArticleAcademicpeer-review

Abstract

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. (C) 2016 Elsevier B.V. All rights reserved.

Original languageEnglish
Pages (from-to)389-393
Number of pages5
JournalDiscrete Applied Mathematics
Volume217
Issue number3
DOIs
Publication statusPublished - 30 Jan 2017

Keywords

  • Algorithms
  • Database
  • GRAPHS
  • Graphs
  • LOWER BOUNDS
  • TREEWIDTH
  • Tree decomposition
  • Treewidth

Cite this