Login / Signup

Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks.

Rafael F. SantosAlessandro AndrioniAndré C. DrummondEduardo C. Xavier
Published in: J. Comb. Optim. (2017)
Keyphrases
  • np hardness
  • real time
  • computationally expensive
  • np hard
  • shortest path
  • wavelength division multiplexing
  • social networks
  • computational complexity
  • optimization problems
  • worst case analysis