Login / Signup

Lower Bounds for Fully Dynamic Connectivity Problems in Graphs.

Monika Rauch HenzingerMichael L. Fredman
Published in: Algorithmica (1998)
Keyphrases
  • lower bound
  • np hard
  • optimization problems
  • dynamic environments
  • mathematical programming
  • graph partitioning
  • randomly generated problems