Recent Advances in Positive-Instance Driven Graph Searching
Research on the similarity of a graph to being a tree—called the <i>treewidth</i> 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 m...
| Hoofdauteurs: | , |
|---|---|
| Formaat: | Artikel |
| Taal: | English |
| Gepubliceerd in: |
MDPI AG
2022-01-01
|
| Reeks: | Algorithms |
| Onderwerpen: | |
| Online toegang: | https://www.mdpi.com/1999-4893/15/2/42 |