Sampling to provide or to bound: With applications to fully dynamic graph algorithms

• 1 December 1997
• journal article
• research article
• Published by Wiley in Random Structures & Algorithms
• Vol. 11  (4) , 369-379
• https://doi.org/10.1002/(sici)1098-2418(199712)11:4<369::aid-rsa5>3.0.co;2-x

Abstract

Keywords

• DYNAMIC GRAPH ALGORITHM
• UPPER BOUND