Positive-Instance Driven Dynamic Programming for Graph Searching

Max Bannach*, Sebastian Berndt

*Korrespondierende/r Autor/-in für diese Arbeit


Research on the similarity of a graph to being a tree – called the treewidth of the graph – has seen an enormous rise within the last decade, but a practically fast algorithm for this task has been discovered only recently by Tamaki (ESA 2017). It is based on dynamic programming and makes use of the fact that the number of positive subinstances is typically substantially smaller than the number of all subinstances. Algorithms producing only such subinstances are called positive-instance driven (PID). We give an alternative and intuitive view on this algorithm from the perspective of the corresponding configuration graphs in certain two-player games. This allows us to develop PID-algorithms for a wide range of important graph parameters such as treewidth, pathwidth, and treedepth. We analyse the worst case behaviour of the approach on some well-known graph classes and perform an experimental evaluation on real world and random graphs.

TitelWADS 2019: Algorithms and Data Structures
Redakteure/-innenZachary Friggstad, Jörg-Rüdiger Sack, Mohammad R Salavatipour
Band11646 LNCS
Herausgeber (Verlag)Springer, Cham
ISBN (Print)978-3-030-24765-2
ISBN (elektronisch)978-3-030-24766-9
PublikationsstatusVeröffentlicht - 12.07.2019
Veranstaltung16th International Symposium on Algorithms and Data Structures - Edmonton, Kanada
Dauer: 05.08.201907.08.2019
Konferenznummer: 229299


Untersuchen Sie die Forschungsthemen von „Positive-Instance Driven Dynamic Programming for Graph Searching“. Zusammen bilden sie einen einzigartigen Fingerprint.