Login / Signup

Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem.

Ahmad BiniazProsenjit BoseIngo van DuijnAnil MaheshwariMichiel H. M. Smid
Published in: J. Graph Algorithms Appl. (2017)
Keyphrases
  • computational complexity
  • graph theory
  • significant improvement
  • optimization problems
  • theoretical analysis
  • orders of magnitude
  • times faster
  • data structure
  • lower bound
  • random walk
  • polynomial time complexity