Finding maximal link disjoint paths in a multigraph
暂无分享,去创建一个
[1] Wayne Davy Grover. Self-healing networks: a distributed algorithm fork-shortest link-disjoint paths in a multigraph with applications in real-time network restoration , 1989 .
[2] H. R. Amirazizi. Controlling synchronous networks with digital cross-connect systems , 1988, IEEE Global Telecommunications Conference and Exhibition. Communications for the Information Age.
[3] W. D. Grover,et al. The selfhealing network : A fast distributed restoration technique for networks using digital crossconnect machines , 1987 .
[4] C. H. Yang,et al. FITNESS-failure immunization technology for network services survivability , 1988, IEEE Global Telecommunications Conference and Exhibition. Communications for the Information Age.
[5] J. W. Suurballe. Disjoint paths in a network , 1974, Networks.