Login / Signup

Dynamic graph connectivity in polylogarithmic worst case time.

Bruce M. KapronValerie KingBen Mountjoy
Published in: SODA (2013)
Keyphrases
  • worst case
  • graph connectivity
  • lower bound
  • expert systems
  • np hard
  • upper bound
  • information extraction
  • dynamic environments