{"title":"Improved sampling with applications to dynamic graph algorithms","conference":{"location":"Paderborn, Germany","end_date":"1996-07-12","start_date":"1996-07-08","name":"ICALP: International Colloquium on Automata, Languages, and Programming"},"doi":"10.1007/3-540-61440-0_136","language":[{"iso":"eng"}],"article_processing_charge":"No","publisher":"Springer Nature","month":"07","intvolume":"      1099","day":"01","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger"},{"first_name":"Mikkel","full_name":"Thorup, Mikkel","last_name":"Thorup"}],"date_created":"2022-08-18T06:42:24Z","abstract":[{"text":"We state a new sampling lemma and use it to improve the running time of dynamic graph algorithms.\r\n\r\nFor the dynamic connectivity problem the previously best randomized algorithm takes expected time O(log3 n) per update, amortized over Ω(m) updates. Using the new sampling lemma, we improve its running time to O(log2 n). There exists a lower bound in the cell probe model for the time per operation of Ω(log n/ log log n) for this problem.\r\n\r\nSimilarly improved running times are achieved for 2-edge connectivity, k-weight minimum spanning tree, and bipartiteness.","lang":"eng"}],"_id":"11910","publication_identifier":{"eisbn":["9783540685807"],"isbn":["9783540614401"],"eissn":["1611-3349"],"issn":["0302-9743"]},"page":"290-299","alternative_title":["LNCS"],"type":"conference","publication":"23rd International Colloquium on Automata, Languages, and Programming","date_published":"1996-07-01T00:00:00Z","citation":{"apa":"Henzinger, M. H., &#38; Thorup, M. (1996). Improved sampling with applications to dynamic graph algorithms. In <i>23rd International Colloquium on Automata, Languages, and Programming</i> (Vol. 1099, pp. 290–299). Paderborn, Germany: Springer Nature. <a href=\"https://doi.org/10.1007/3-540-61440-0_136\">https://doi.org/10.1007/3-540-61440-0_136</a>","short":"M.H. Henzinger, M. Thorup, in:, 23rd International Colloquium on Automata, Languages, and Programming, Springer Nature, 1996, pp. 290–299.","chicago":"Henzinger, Monika H, and Mikkel Thorup. “Improved Sampling with Applications to Dynamic Graph Algorithms.” In <i>23rd International Colloquium on Automata, Languages, and Programming</i>, 1099:290–99. Springer Nature, 1996. <a href=\"https://doi.org/10.1007/3-540-61440-0_136\">https://doi.org/10.1007/3-540-61440-0_136</a>.","mla":"Henzinger, Monika H., and Mikkel Thorup. “Improved Sampling with Applications to Dynamic Graph Algorithms.” <i>23rd International Colloquium on Automata, Languages, and Programming</i>, vol. 1099, Springer Nature, 1996, pp. 290–99, doi:<a href=\"https://doi.org/10.1007/3-540-61440-0_136\">10.1007/3-540-61440-0_136</a>.","ieee":"M. H. Henzinger and M. Thorup, “Improved sampling with applications to dynamic graph algorithms,” in <i>23rd International Colloquium on Automata, Languages, and Programming</i>, Paderborn, Germany, 1996, vol. 1099, pp. 290–299.","ista":"Henzinger MH, Thorup M. 1996. Improved sampling with applications to dynamic graph algorithms. 23rd International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LNCS, vol. 1099, 290–299.","ama":"Henzinger MH, Thorup M. Improved sampling with applications to dynamic graph algorithms. In: <i>23rd International Colloquium on Automata, Languages, and Programming</i>. Vol 1099. Springer Nature; 1996:290-299. doi:<a href=\"https://doi.org/10.1007/3-540-61440-0_136\">10.1007/3-540-61440-0_136</a>"},"volume":1099,"extern":"1","year":"1996","scopus_import":"1","status":"public","oa_version":"None","date_updated":"2023-02-14T07:57:14Z","publication_status":"published"}