Factorization theory in diameter constrained reliability
暂无分享,去创建一个
[1] Eytan Adar,et al. Free Riding on Gnutella , 2000, First Monday.
[2] Jean-Claude Bermond,et al. Surveys in Combinatorics: GRAPHS AND INTERCONNECTION NETWORKS: DIAMETER AND VULNERABILITY , 1983 .
[3] John G. van Bosse,et al. Wiley Series in Telecommunications and Signal Processing , 2006 .
[4] A. Rosenthal. Computing the Reliability of Complex Networks , 1977 .
[5] Robert E. Tarjan,et al. A quick method for finding shortest pairs of disjoint paths , 1984, Networks.
[6] Kishor S. Trivedi,et al. A survey of efficient reliability computation using disjoint products approach , 1995, Networks.
[7] Fred Moskowitz,et al. The analysis of redundancy networks , 1958, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.
[8] Stephen E. Deering,et al. Internet Protocol, Version 6 (IPv6) Specification , 1995, RFC.
[9] Wei Guo,et al. Sliding scheduled lightpath provisioning by mixed partition coloring in WDM optical networks , 2013, Opt. Switch. Netw..
[10] Michael O. Ball,et al. Computational Complexity of Network Reliability Analysis: An Overview , 1986, IEEE Transactions on Reliability.
[11] Héctor Cancela,et al. Polynomial-Time Topological Reductions That Preserve the Diameter Constrained Reliability of a Communication Network , 2011, IEEE Transactions on Reliability.
[12] J. Scott Provan,et al. The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected , 1983, SIAM J. Comput..
[13] Gerardo Rubino,et al. On computing the 2-diameter -constrained K -reliability of networks , 2013, Int. Trans. Oper. Res..
[14] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.
[15] Héctor Cancela,et al. Reliability of communication networks with delay constraints: computational complexity and complete topologies , 2004, Int. J. Math. Math. Sci..
[16] Walid Ben-Ameur,et al. Constrained length connectivity and survivable networks , 2000, Networks.
[17] LOUIS PETINGI. Diameter-related properties of graphs and applications to network reliability theory , 2013 .
[18] Eric V. Denardo,et al. Flows in Networks , 2011 .
[19] Pablo Romero,et al. Full complexity analysis of the diameter-constrained reliability , 2015, Int. Trans. Oper. Res..
[20] D.Frank Hsu,et al. On Container Width and Length in Graphs, Groups,and Networks--Dedicated to Professor Paul Erdös on the occasion of his 80th birthday-- , 1994 .
[21] Appajosyula Satyanarayana,et al. A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks , 1985, SIAM J. Comput..
[22] J. W. Suuballe,et al. Disjoint Paths in a Network , 2022 .
[23] Mark K. Chang,et al. Network reliability and the factoring theorem , 1983, Networks.
[24] Thomas M. Cover,et al. Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing) , 2006 .
[25] Eduardo Alberto Canale,et al. Diameter constrained reliability: Complexity, distinguished topologies and asymptotic behavior , 2015, Networks.