Resilience of partial k-tree networks with edge and node failures
暂无分享,去创建一个
[1] J. Scott Provan,et al. The Complexity of Reliability Computations in Planar and Acyclic Graphs , 1986, SIAM J. Comput..
[2] Hans L. Bodlaender,et al. NC-Algorithms for Graphs with Small Treewidth , 1988, WG.
[3] S. Arnborg,et al. Characterization and recognition of partial 3-trees , 1986 .
[4] Derek G. Corneil,et al. Complexity of finding embeddings in a k -tree , 1987 .
[5] Stefan Arnborg,et al. Linear time algorithms for NP-hard problems restricted to partial k-trees , 1989, Discret. Appl. Math..
[6] David S. Johnson. The NP-Completeness Column: An Ongoing Guide , 1986, J. Algorithms.
[7] J. Scott Provan,et al. The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected , 1983, SIAM J. Comput..
[8] Charles J. Colbourn,et al. Steiner trees, partial 2-trees, and minimum IFI networks , 1983, Networks.
[9] Charles J. Colbourn,et al. The Combinatorics of Network Reliability , 1987 .
[10] H. Bodlaender. Classes of graphs with bounded tree-width , 1986 .
[11] Charles J. Colbourn,et al. Network resilience , 1987 .