{"status":"public","publisher":"Schloss Dagstuhl - Leibniz Zentrum für Informatik","day":"04","quality_controlled":"1","date_created":"2021-11-07T23:01:23Z","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"volume":209,"date_published":"2021-10-04T00:00:00Z","publication_identifier":{"issn":["1868-8969"],"isbn":["9-783-9597-7210-5"]},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","conference":{"name":"DISC: Distributed Computing","location":"Freiburg, Germany","end_date":"2021-10-08","start_date":"2021-10-04"},"department":[{"_id":"DaAl"}],"month":"10","article_processing_charge":"No","file":[{"creator":"cchlebak","file_size":795860,"date_updated":"2021-11-12T09:23:22Z","file_name":"2021_LIPIcsDISC_BChatterjee.pdf","success":1,"access_level":"open_access","relation":"main_file","file_id":"10276","checksum":"76546df112a0ba1166c864d33d7834e2","content_type":"application/pdf","date_created":"2021-11-12T09:23:22Z"}],"date_updated":"2021-11-12T09:42:55Z","article_number":"52","file_date_updated":"2021-11-12T09:23:22Z","has_accepted_license":"1","doi":"10.4230/LIPIcs.DISC.2021.52","_id":"10216","year":"2021","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"}],"ddc":["000"],"title":"Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds","type":"conference","alternative_title":["LIPIcs"],"oa":1,"publication":"35th International Symposium on Distributed Computing","oa_version":"Published Version","intvolume":" 209","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","external_id":{"arxiv":["2003.01697"]},"language":[{"iso":"eng"}],"scopus_import":"1","author":[{"id":"3C41A08A-F248-11E8-B48F-1D18A9856A87","first_name":"Bapi","full_name":"Chatterjee, Bapi","last_name":"Chatterjee"},{"first_name":"Sathya","full_name":"Peri, Sathya","last_name":"Peri"},{"first_name":"Muktikanta","last_name":"Sa","full_name":"Sa, Muktikanta"}],"citation":{"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.","mla":"Chatterjee, Bapi, et al. “Brief Announcement: Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds.” 35th International Symposium on Distributed Computing, vol. 209, 52, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.DISC.2021.52.","short":"B. Chatterjee, S. Peri, M. Sa, in:, 35th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.","ama":"Chatterjee B, Peri S, Sa M. Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds. In: 35th International Symposium on Distributed Computing. Vol 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.DISC.2021.52","apa":"Chatterjee, B., Peri, S., & Sa, M. (2021). Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds. In 35th International Symposium on Distributed Computing (Vol. 209). Freiburg, Germany: Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2021.52","ieee":"B. Chatterjee, S. Peri, and M. Sa, “Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds,” in 35th International Symposium on Distributed Computing, Freiburg, Germany, 2021, vol. 209.","chicago":"Chatterjee, Bapi, Sathya Peri, and Muktikanta Sa. “Brief Announcement: Non-Blocking Dynamic Unbounded Graphs with Worst-Case Amortized Bounds.” In 35th International Symposium on Distributed Computing, Vol. 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.DISC.2021.52."},"publication_status":"published"}