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

边诱导顶点割的复杂性及其应用

Complexity and Applications of Edge-Induced Vertex-Cuts

Marko Samer, Stefan Szeider

摘要:

受超图分解算法的启发,我们引入了边诱导顶点割的概念,并将其与著名的边割和顶点割的概念进行了比较。我们研究了计算最小边诱导顶点割的复杂性,并通过在网络可靠性和约束满足方面的应用证明了我们的概念的实用性。

英文摘要:

Motivated by hypergraph decomposition algorithms, we introduce the notion of edge-induced vertex-cuts and compare it with the well-known notions of edge-cuts and vertex-cuts. We investigate the complexity of computing minimum edge-induced vertex-cuts and demonstrate the usefulness of our notion by applications in network reliability and constraint satisfaction.

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

↑