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

直径约束可靠性:根据直径和端子数量的计算复杂性

Diameter Constrained Reliability: Computational Complexity in terms of the diameter and number of terminals

Eduardo Canale, Pablo Romero

摘要:

设$G=(V,E)$是一个简单图,它有$|V|=n$节点和$|E|=m$链路,\emph{terminals}的子集$K \subseteq V$,一个向量$p=(p_1,\ldots,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)$表示。一般的DCR计算属于$\mathcal{N}\mathcal{P}$ -Hard问题,因为它包含了随机图连通的复杂性。本文从终端节点数$k=|K|$和直径$d$的角度讨论了DCR子问题的计算复杂性。无论是当$d=1$还是当$d=2$和$k$固定时,DCR都在多项式时间问题的类$\mathcal{P}$内。当$k \geq 2$为固定输入参数且$d\geq 3$为固定输入参数时,DCR将$\mathcal{N}\mathcal{P}$ -Hard变为硬。$k=n$和$d \geq 2$固定的情况在先前的文献中没有研究。在此,确定了该外壳的$\mathcal{N}\mathcal{P}$硬度。

英文摘要:

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,\ldots,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 DCR computation is inside the class of $\mathcal{N}\mathcal{P}$-Hard problems, since is subsumes the complexity that a random graph is connected. In this paper, the computational complexity of DCR-subproblems is discussed 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 when $k \geq 2$ is a fixed input parameter and $d\geq 3$. The case where $k=n$ and $d \geq 2$ is fixed are not studied in prior literature. Here, the $\mathcal{N}\mathcal{P}$-Hardness of this case is established.

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

↑