{"article_processing_charge":"No","date_created":"2022-08-17T07:21:55Z","month":"12","citation":{"apa":"Henzinger, M. H., &#38; Thorup, M. (1997). Sampling to provide or to bound: With applications to fully dynamic graph algorithms. <i>Random Structures and Algorithms</i>. Wiley. <a href=\"https://doi.org/10.1002/(sici)1098-2418(199712)11:4&#60;369::aid-rsa5&#62;3.0.co;2-x\">https://doi.org/10.1002/(sici)1098-2418(199712)11:4&#60;369::aid-rsa5&#62;3.0.co;2-x</a>","ista":"Henzinger MH, Thorup M. 1997. Sampling to provide or to bound: With applications to fully dynamic graph algorithms. Random Structures and Algorithms. 11(4), 369–379.","chicago":"Henzinger, Monika H, and Mikkel Thorup. “Sampling to Provide or to Bound: With Applications to Fully Dynamic Graph Algorithms.” <i>Random Structures and Algorithms</i>. Wiley, 1997. <a href=\"https://doi.org/10.1002/(sici)1098-2418(199712)11:4&#60;369::aid-rsa5&#62;3.0.co;2-x\">https://doi.org/10.1002/(sici)1098-2418(199712)11:4&#60;369::aid-rsa5&#62;3.0.co;2-x</a>.","ieee":"M. H. Henzinger and M. Thorup, “Sampling to provide or to bound: With applications to fully dynamic graph algorithms,” <i>Random Structures and Algorithms</i>, vol. 11, no. 4. Wiley, pp. 369–379, 1997.","short":"M.H. Henzinger, M. Thorup, Random Structures and Algorithms 11 (1997) 369–379.","ama":"Henzinger MH, Thorup M. Sampling to provide or to bound: With applications to fully dynamic graph algorithms. <i>Random Structures and Algorithms</i>. 1997;11(4):369-379. doi:<a href=\"https://doi.org/10.1002/(sici)1098-2418(199712)11:4&#60;369::aid-rsa5&#62;3.0.co;2-x\">10.1002/(sici)1098-2418(199712)11:4&#60;369::aid-rsa5&#62;3.0.co;2-x</a>","mla":"Henzinger, Monika H., and Mikkel Thorup. “Sampling to Provide or to Bound: With Applications to Fully Dynamic Graph Algorithms.” <i>Random Structures and Algorithms</i>, vol. 11, no. 4, Wiley, 1997, pp. 369–79, doi:<a href=\"https://doi.org/10.1002/(sici)1098-2418(199712)11:4&#60;369::aid-rsa5&#62;3.0.co;2-x\">10.1002/(sici)1098-2418(199712)11:4&#60;369::aid-rsa5&#62;3.0.co;2-x</a>."},"day":"07","page":"369-379","article_type":"original","publisher":"Wiley","year":"1997","status":"public","date_published":"1997-12-07T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","extern":"1","volume":11,"date_updated":"2023-02-17T14:05:02Z","language":[{"iso":"eng"}],"intvolume":"        11","publication_identifier":{"eissn":["1098-2418"],"issn":["1042-9832"]},"title":"Sampling to provide or to bound: With applications to fully dynamic graph algorithms","quality_controlled":"1","scopus_import":"1","author":[{"orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger"},{"full_name":"Thorup, Mikkel","first_name":"Mikkel","last_name":"Thorup"}],"doi":"10.1002/(sici)1098-2418(199712)11:4<369::aid-rsa5>3.0.co;2-x","_id":"11883","abstract":[{"lang":"eng","text":"In dynamic graph algorithms the following provide-or-bound problem has to be solved quickly: Given a set S containing a subset R and a way of generating random elements from S testing for membership in R, either (i) provide an element of R, or (ii) give a (small) upper bound on the size of R that holds with high probability. We give an optimal algorithm for this problem. This algorithm improves the time per operation for various dynamic graph algorithms by a factor of O(log n). For example, it improves the time per update for fully dynamic connectivity from O(log3n) to O(log2n)."}],"oa_version":"None","publication_status":"published","publication":"Random Structures and Algorithms","issue":"4"}