Login / Signup

Iteration-free node-disjoint paths search in WDM networks with asymmetric nodes.

Tomohiro HashiguchiYi ZhuKazuyuki TajimaYutaka TakitaTakao NaitoJason P. Jue
Published in: ONDM (2012)
Keyphrases
  • disjoint paths
  • directed graph
  • undirected graph
  • approximation algorithms
  • wdm networks
  • random walk
  • graph structure
  • link failure
  • network structure
  • social networks