On Tamaki’s Algorithm to Compute Treewidths

Althaus, Ernst; Schnurbusch, Daniela; Wüschner, Julian; Ziegler, Sarah

doi:10.4230/lipics.sea.2021.9

2021

DOI: 10.4230/lipics.sea.2021.9

|View full text |Cite

On Tamaki’s Algorithm to Compute Treewidths

Ernst Althaus

Daniela Schnurbusch²,

Julian Wüschner³

et al.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2022

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Recent Advances in Positive-Instance Driven Graph Searching

Bannach

Berndt

2022

Algorithms

View full text Add to dashboard Cite

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). The parameter treedepth has a similar story. It was popularized through the graph sparsity project and is theoretically well understood—but the first practical algorithm was discovered only recently by Trimble (IPEC 2020) and is based on the same paradigm. We give an alternative and unifying view on such algorithms from the perspective of the corresponding configuration graphs in certain two-player games. This results in a single algorithm that can compute a wide range of important graph parameters such as treewidth, pathwidth, and treedepth. We complement this algorithm with a novel randomized data structure that accelerates the enumeration of subproblems in positive-instance driven algorithms.

show abstract

Recent Advances in Positive-Instance Driven Graph Searching

Bannach

Berndt

2022

Algorithms

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

On Tamaki’s Algorithm to Compute Treewidths

Cited by 1 publication

References 0 publications

Recent Advances in Positive-Instance Driven Graph Searching

Recent Advances in Positive-Instance Driven Graph Searching

Contact Info

Product

Resources

About