Login / Signup
Calculating a maximally node and SRLG-disjoint path pair of min-sum cost in GMPLS networks.
Teresa Gomes
Luísa Jorge
Paulo E. Melo
Rita Girão-Silva
Sergio Mendes
Published in:
DRCN (2013)
Keyphrases
</>
min sum
path length
link failure
pairwise
wdm networks
protection scheme
multicast tree
shortest path
goal programming
minimum cost
np hard
social networks
lower bound
min cut
network structure
directed graph
complex networks
social network analysis