Directed Acyclic Graphs
Christianson, B. and Santanu, Dash
(2025)
Directed Acyclic Graphs.
[Data Collection]
This source code implements a unified framework for pre-processing Directed Acyclic Graphs (DAGs) to lookup reachability between two vertices as well as compute the least upper bound of two vertices in constant time. Our framework builds on the adaptive pre-processing algorithm for constant time reachability lookups and extends this to compute the least upper bound of a vertex-pair in constant time. The theoretical details of this work can be found in the research paper which is available at http://uhra.herts.ac.uk/handle/2299/12152
Item Type | Data Collection |
---|---|
Identification Number | 10.18745/ds.16553 |
Date Deposited | 28 May 2025 22:13 |
Last Modified | 12 Aug 2025 14:02 |
Explore Further
code v2.zip
-
subject - Full Archive
-
- Available under Creative Commons: BY-ND 4.0
folder_zip - application/zip
- folder_info
- 134kB
Download this file
Share this file
readme v2.txt
-
subject - Full Archive
-
- Available under Creative Commons: BY-ND 4.0
description - text/plain
- folder_info
- 688B
Download this file
Share this file
Downloads
?
Total file downloads from UHRA since January 2020. For more information on metrics see the IRUS guide.