Profiles
Research Units
Publications
Sign Up
Faculty Login
X
Conferences
Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds
B. Chatterjee
,
Sathya Peri
,
M. Sa
Published in Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
2021
DOI:
10.4230/LIPIcs.DISC.2021.52
Volume: 209
Abstract
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. © Bapi Chatterjee, Sathya Peri, and Muktikanta Sa; licensed under Creative Commons License CC-BY 4.0
Request full-text
Cite
Content may be subject to copyright.
Journal Details
Authors (1)
About the journal
Journal
Leibniz International Proceedings in Informatics, LIPIcs
Publisher
Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISSN
18688969
Authors (1)
Sathya Peri
Department of Computer Science and Engineering
Recent publications
DiPETrans: A framework for distributed parallel execution of transactions of blocks in blockchains
Efficient Concurrent Execution of Smart Contracts in Blockchains Using Object-Based Transactional Memory
Entitling concurrency to smart contracts using optimistic transactional memory
S-gossip: Security enhanced gossip protocol for unstructured P2P networks
Get all the updates for this publication
Follow