{"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"success":1,"date_created":"2021-11-12T09:23:22Z","file_size":795860,"date_updated":"2021-11-12T09:23:22Z","file_name":"2021_LIPIcsDISC_BChatterjee.pdf","creator":"cchlebak","access_level":"open_access","content_type":"application/pdf","checksum":"76546df112a0ba1166c864d33d7834e2","relation":"main_file","file_id":"10276"}],"abstract":[{"text":"This paper reports a new concurrent graph data structure that supports updates of both edges and vertices and queries: Breadth-first search, Single-source shortest-path, and Betweenness centrality. The operations are provably linearizable and non-blocking.","lang":"eng"}],"citation":{"ama":"Chatterjee B, Peri S, Sa M. Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds. In: <i>35th International Symposium on Distributed Computing</i>. Vol 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2021.52\">10.4230/LIPIcs.DISC.2021.52</a>","apa":"Chatterjee, B., Peri, S., &#38; Sa, M. (2021). Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds. In <i>35th International Symposium on Distributed Computing</i> (Vol. 209). Freiburg, Germany: Schloss Dagstuhl - Leibniz Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2021.52\">https://doi.org/10.4230/LIPIcs.DISC.2021.52</a>","ieee":"B. Chatterjee, S. Peri, and M. Sa, “Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds,” in <i>35th International Symposium on Distributed Computing</i>, Freiburg, Germany, 2021, vol. 209.","ista":"Chatterjee B, Peri S, Sa M. 2021. Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds. 35th International Symposium on Distributed Computing. DISC: Distributed Computing, LIPIcs, vol. 209, 52.","chicago":"Chatterjee, Bapi, Sathya Peri, and Muktikanta Sa. “Brief Announcement: Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds.” In <i>35th International Symposium on Distributed Computing</i>, Vol. 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2021.52\">https://doi.org/10.4230/LIPIcs.DISC.2021.52</a>.","mla":"Chatterjee, Bapi, et al. “Brief Announcement: Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds.” <i>35th International Symposium on Distributed Computing</i>, vol. 209, 52, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2021.52\">10.4230/LIPIcs.DISC.2021.52</a>.","short":"B. Chatterjee, S. Peri, M. Sa, in:, 35th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021."},"ddc":["000"],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","language":[{"iso":"eng"}],"department":[{"_id":"DaAl"}],"title":"Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds","author":[{"first_name":"Bapi","id":"3C41A08A-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Bapi","last_name":"Chatterjee"},{"last_name":"Peri","full_name":"Peri, Sathya","first_name":"Sathya"},{"full_name":"Sa, Muktikanta","last_name":"Sa","first_name":"Muktikanta"}],"publication_status":"published","license":"https://creativecommons.org/licenses/by/4.0/","oa":1,"conference":{"start_date":"2021-10-04","name":"DISC: Distributed Computing","location":"Freiburg, Germany","end_date":"2021-10-08"},"has_accepted_license":"1","acknowledgement":"This work was partially funded by National Supercomputing Mission, Govt. of India under the project “Concurrent and Distributed Programming primitives and algorithms for Temporal Graphs”(DST/NSM/R&D_Exascale/2021/16).\r\n","volume":209,"external_id":{"arxiv":["2003.01697"]},"publication":"35th International Symposium on Distributed Computing","status":"public","date_created":"2021-11-07T23:01:23Z","doi":"10.4230/LIPIcs.DISC.2021.52","article_processing_charge":"No","date_published":"2021-10-04T00:00:00Z","intvolume":"       209","article_number":"52","month":"10","type":"conference","day":"04","date_updated":"2021-11-12T09:42:55Z","quality_controlled":"1","oa_version":"Published Version","scopus_import":"1","file_date_updated":"2021-11-12T09:23:22Z","publication_identifier":{"issn":["1868-8969"],"isbn":["9-783-9597-7210-5"]},"alternative_title":["LIPIcs"],"year":"2021","publisher":"Schloss Dagstuhl - Leibniz Zentrum für Informatik","_id":"10216"}