Directed Acyclic Graph CRDTs
Directed Acyclic Graphs (DAGs) are essential for applications like modeling task dependencies. Maintaining DAG integrity in distributed and collaborative systems is challenging, especially in environments prioritizing high availability over strong consistency. These challenges are amplified by unreliable connectivity or offline operations, where clients replicate and independently modify the graph. Ensuring invariants such as cycle freedom and valid edge connections under concurrent updates is crucial.
Authors
- Annette Bieniusa (ORCID: https://orcid.org/0000-0002-1654-6118)
- Evelyn Borth (ORCID: https://orcid.org/0009-0004-4384-7305)
- Philipp Lersch (ORCID: https://orcid.org/0009-0007-7345-6809)
Institutions
- University of Kaiserslautern (DE)
- University of Koblenz and Landau (DE)
Publication Details
- Published
- 2025-03-30
- DOI
- https://doi.org/10.1145/3721473.3722141
- Primary Topic
- graph theory and CDMA systems
- Type
- article
- Field-Weighted Citation Impact
- 0.00