arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1602.01385cs.CC
收藏

平面图的最小公共边问题

The Minimum Shared Edges Problem on Planar Graphs

Till Fluschnik, Manuel Sorge

摘要:

我们在平面图上研究Omran等人[Journal of组合优化,2015]引入的最小共享边问题:平面MSE要求,给定平面图G =(V,E),V中的两个不同顶点s,t和两个整数p,k,是否存在G中共享至多k条边的p s-t条路,其中如果边出现在至少两个p-s-t路径中,则边被称为共享的。我们证明了平面MSE是NP-困难的减少顶点覆盖。我们使用一个类似网格的结构,其中网格中的边缘对齐(水平/垂直)分别对应于选择和验证小工具。

英文摘要:

We study the Minimum Shared Edges problem introduced by Omran et al. [Journal of Combinatorial Optimization, 2015] on planar graphs: Planar MSE asks, given a planar graph G = (V,E), two distinct vertices s,t in V , and two integers p, k, whether there are p s-t paths in G that share at most k edges, where an edges is called shared if it appears in at least two of the p s-t paths. We show that Planar MSE is NP-hard by reduction from Vertex Cover. We make use of a grid-like structure, where the alignment (horizontal/vertical) of the edges in the grid correspond to selection and validation gadgets respectively.

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

↑