无关分量与直径约束可靠度的精确计算
Irrelevant Components and Exact Computation of the Diameter Constrained Reliability
摘要:
设$G=(V,E)$是一个简单图,它有$|V|=n$节点和$|E|=m$链路,\emph{terminals}的子集$K \subseteq V$,一个向量$p=(p_1,...,p_m) \in [0,1]^m$和一个正整数$d$,称为\emph{diameter} .我们假设节点是完美的,但链接失败随机和独立的概率$q_i=1-p_i$。\emph{diameter-constrained reliability}(简称DCR),是结果子图的终端通过由$d$链路组成的路径保持连接的概率,或更少。这个数字用$R_{K,G}^{d}(p)$表示。参数$R_{K,G}^{d}(p)$的一般计算属于$\mathcal{N}\mathcal{P}$ -Hard问题类,因为它包含了随机图连通的复杂性。DCR子问题的计算复杂性的讨论中提供的终端节点$k=|K|$和直径$d$的数量。无论是当$d=1$还是当$d=2$和$k$固定时,DCR都在多项式时间问题的类$\mathcal{P}$内。即使$k \geq 2$和$d\geq 3$是固定的,或者在$d=2$为全终端的情况下,DCR也会将$\mathcal{N}\mathcal{P}$ -变为硬。传统的方法是为特定的图类设计指数精确算法或有效的解决方案。本文的贡献是双重的。首先,一个新的递归类的图被证明具有高效的DCR计算。其次,我们定义了一个因式分解方法,以发展一个精确的DCR计算一般。该方法的灵感来自于先前的工作与无关链接和删除收缩公式的确定。
英文摘要:
Let $G=(V,E)$ be a simple graph with $|V|=n$ nodes and $|E|=m$ links, a subset $K \subseteq V$ of \emph{terminals}, a vector $p=(p_1,...,p_m) \in [0,1]^m$ and a positive integer $d$, called \emph{diameter}. We assume nodes are perfect but links fail stochastically and independently, with probabilities $q_i=1-p_i$. The \emph{diameter-constrained reliability} (DCR for short), is the probability that the terminals of the resulting subgraph remain connected by paths composed by $d$ links, or less. This number is denoted by $R_{K,G}^{d}(p)$. The general computation of the parameter $R_{K,G}^{d}(p)$ belongs to the class of $\mathcal{N}\mathcal{P}$-Hard problems, since is subsumes the complexity that a random graph is connected. A discussion of the computational complexity for DCR-subproblems is provided in terms of the number of terminal nodes $k=|K|$ and diameter $d$. Either when $d=1$ or when $d=2$ and $k$ is fixed, the DCR is inside the class $\mathcal{P}$ of polynomial-time problems. The DCR turns $\mathcal{N}\mathcal{P}$-Hard even if $k \geq 2$ and $d\geq 3$ are fixed, or in an all-terminal scenario when $d=2$. The traditional approach is to design either exponential exact algorithms or efficient solutions for particular graph classes. The contributions of this paper are two-fold. First, a new recursive class of graphs are shown to have efficient DCR computation. Second, we define a factorization method in order to develop an exact DCR computation in general. The approach is inspired in prior works related with the determination of irrelevant links and deletion-contraction formula.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。