令 tw(G) 表示图 G 的树宽。给定一个图 G 和一个正整数 k,且满足 tw(G) <= k + 1,我们需要判定是否有 tw(G) <= k。我们为这一任务给出一个带证书的算法 RTW(“R”表示递归):如果答案是 YES,它返回一个或多个宽度 <= k 的 G 的树分解;否则返回 G 的一个极小收缩 H,使得 tw(H) > k。RTW 使用 Tamaki 的树宽 PID 算法(ESA2017)的一个启发式变体,我们称之为 HPID。给定 G 和 k,RTW 将 HPID 的执行与对 G 的边 e 的 G/e 上的递归调用交错进行,其中 G/e 表示收缩边 e 后由图 G 得到的图。如果我们发现 tw(G/e) > k,则我们得到 tw(G) > k,且具有相同的证书。如果我们发现 tw(G/e) <= k,我们将 G/e 的带证书树分解的包“反收缩”为 G 的包,并将它们提供给 HPID 以帮助推进。如果在所有边上完成递归调用后问题仍未解决,我们以穷举模式完成 HPID。如果最终结果是 tw(G) > k,那么 G 就是每个以 G 为收缩的图 G' 满足 tw(G') > k 的证书,因为我们已经发现对 G 的每条边 e 都有 tw(G/e) <= k。这最后一轮 HPID 保证了算法的正确性,而其实际效率来源于我们将 G/e 的树分解的包“反收缩”为 G 的有用包的方法,以及在 HPID 中利用这些包的方法。实验表明,我们的算法极大地扩展了实际可解实例的范围。特别是,当应用于 PACE 2017 附加集中的 100 个实例时,在典型笔记本电脑上,每个实例超时时间为 100、1000 和 10000 秒的情况下,我们的实现解出的实例数分别为 72、92 和 98,而 Tamaki 的 PID 求解器的这些数字为 11、38 和 68,他的新求解器(SEA 2022)为 65、82 和 85。
英文摘要:
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" for recursive) for this task: it returns one or more tree-decompositions of G of width <= k if the answer is YES and a minimal contraction H of G such that tw(H) > k otherwise.
RTW uses a heuristic variant of Tamaki's PID algorithm for treewidth (ESA2017), which we call HPID. RTW, given G and k, interleaves the execution of HPID with recursive calls on G /e for edges e of G, where G / e denotes the graph obtained from G by contracting edge e. If we find that tw(G / e) > k, then we have tw(G) > k with the same certificate. If we find that tw(G / e) <= k, we "uncontract" the bags of the certifying tree-decompositions of G / e into bags of G and feed them to HPID to help progress. If the question is not resolved after the recursive calls are made for all edges, we finish HPID in an exhaustive mode. If it turns out that tw(G) > k, then G is a certificate for tw(G') > k for every G' of which G is a contraction, because we have found tw(G / e) <= k for every edge e of G. This final round of HPID guarantees the correctness of the algorithm, while its practical efficiency derives from our methods of "uncontracting" bags of tree-decompositions of G / e to useful bags of G, as well as of exploiting those bags in HPID.
Experiments show that our algorithm drastically extends the scope of practically solvable instances. In particular, when applied to the 100 instances in the PACE 2017 bonus set, the number of instances solved by our implementation on a typical laptop, with the timeout of 100, 1000, and 10000 seconds per instance, are 72, 92, and 98 respectively, while these numbers are 11, 38, and 68 for Tamaki's PID solver and 65, 82, and 85 for his new solver (SEA 2022).