arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1502.00911cs.DScs.CG
收藏

终端数有界的平面有界亏格图的多重割

Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals

Éric Colin de Verdière

摘要:

给定一个无向的边加权图G和一对顶点(称为终端对),最小多割问题要求一个最小权的边集,使得删除这些边后,每对的两个终端属于图的不同连通分支。依赖于拓扑技术,我们提供了一个多项式时间算法的情况下,G是嵌入在一个固定的曲面上的亏格g(例如,当G是平面时),并且具有固定数量t的端子。运行时间是一个多项式的次数为O(sqrt{g^2+gt})的输入大小。在平面情况下,我们的结果纠正了Bentz [Int. Workshop on Parameterized and Exact Computation,109-119,2012]的扩展摘要中的错误。最小多割问题也是多路割问题的一个推广,也称为多路割问题。多端切割问题;即使对于这种特殊情况,也没有专门的算法用于嵌入表面上的图形。

英文摘要:

Given an undirected, edge-weighted graph G together with pairs of vertices, called pairs of terminals, the minimum multicut problem asks for a minimum-weight set of edges such that, after deleting these edges, the two terminals of each pair belong to different connected components of the graph. Relying on topological techniques, we provide a polynomial-time algorithm for this problem in the case where G is embedded on a fixed surface of genus g (e.g., when G is planar) and has a fixed number t of terminals. The running time is a polynomial of degree O(sqrt{g^2+gt}) in the input size. In the planar case, our result corrects an error in an extended abstract by Bentz [Int. Workshop on Parameterized and Exact Computation, 109-119, 2012]. The minimum multicut problem is also a generalization of the multiway cut problem, a.k.a. multiterminal cut problem; even for this special case, no dedicated algorithm was known for graphs embedded on surfaces.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑