网络结构易损性评估的伪分离法
Pseudo-Separation for Assessment of Structural Vulnerability of a Network
摘要：
基于网络功能受损的想法，如果两个节点在一个给定的度量充分分离的网络中，我们引入了两个组合\emph{pseudocut}问题推广经典的最小割和多割问题。我们希望伪割问题将发现广泛的相关性的研究网络的可靠性。对伪割问题的计算复杂性进行了全面的分析，并给出了三种伪割问题的近似算法。出于严格的服务质量（QoS）要求的通信网络中的应用程序，我们证明了伪割问题的效用，提出了一个有针对性的脆弱性评估的结构，使用QoS指标的通信网络，我们在这种情况下，我们提出的近似算法进行实验评估。
英文摘要：
Based upon the idea that network functionality is impaired if two nodes in a network are sufficiently separated in terms of a given metric, we introduce two combinatorial \emph{pseudocut} problems generalizing the classical min-cut and multi-cut problems. We expect the pseudocut problems will find broad relevance to the study of network reliability. We comprehensively analyze the computational complexity of the pseudocut problems and provide three approximation algorithms for these problems. Motivated by applications in communication networks with strict Quality-of-Service (QoS) requirements, we demonstrate the utility of the pseudocut problems by proposing a targeted vulnerability assessment for the structure of communication networks using QoS metrics; we perform experimental evaluations of our proposed approximation algorithms in this context.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
