以FPT延迟枚举小规模最小$s,t$-分隔符
Listing Small Minimal $s,t$-separators in FPT-Delay
AI总结:
本研究提出两种$s,t$-分隔符枚举算法:一种以仅依赖规模上限$k$的FPT延迟枚举基数不超$k$的最小$s,t$-分隔符,另一种按规模排序枚举所有$s,t$-分隔符,成果可应用于树宽参数化算法相关场景。
摘要:
设$G$为无向图,$s,t$为$G$中的指定顶点。最小$s,t$-分隔符是指在集合包含关系下极小的顶点集,移除该集合后$s$和$t$会处于不同的连通分量中。我们提出一种算法,用于枚举图中基数不超过$k$的最小$s,t$-分隔符,该算法具有FPT(固定参数可处理)延迟,其参数仅依赖于$k$。该问题在多种以树宽为参数的算法中存在应用,包括关系数据库中的查询求值、概率推理等诸多场景。我们还提出了一种简单算法,可按规模排序枚举图中所有(不一定是最小的)$s,t$-分隔符。
英文摘要:
Let $G$ be an undirected graph, and $s,t$ distinguished vertices of $G$. A minimal $s,t$-separator is an inclusion-wise minimal vertex-set whose removal places $s$ and $t$ in distinct connected components. We present an algorithm for listing the minimal $s,t$-separators of a graph, whose cardinality is at most $k$, with FPT-delay, where the parameter depends only on $k$. This problem finds applications in various algorithms parameterized by treewidth, which include query evaluation in relational databases, probabilistic inference, and many more. We also present a simple algorithm that enumerates all of the (not necessarily minimal) $s,t$-separators of a graph in ranked order by size.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。