5 citations · 9 across the 8 of their papers we have counts for
1 paper · 1 filter
Hisao Tamaki
Let tw(G) denote the treewidth of graph G. Given a graph G and a positive integer k such that tw(G) <= k + 1, we are to decide if tw(G) <= k. We give a certifying algorithm RTW ("R…