| dc.contributor.author | Christianson, B. | |
| dc.contributor.author | Santanu, Dash | |
| dc.date.accessioned | 2015-12-16T09:34:43Z | |
| dc.date.available | 2015-12-16T09:34:43Z | |
| dc.date.issued | 2015-12-16 | |
| dc.identifier.uri | http://hdl.handle.net/2299/16553 | |
| dc.identifier.uri | http://go.herts.ac.uk/dag | |
| dc.description | This code is copyright (2015) by the University of Hertfordshire and is
made available to third parties for research or private study, criticism
or review, and for the purpose of reporting the state of the art, under the
normal fair use/fair dealing exceptions in Sections 29 and 30 of the
Copyright, Designs and Patents Act 1988. Use of the code under this
provision is limited to non-commercial use: please contact us if you
wish to arrange a licence covering commercial use of the code. | |
| dc.description.abstract | 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 | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.title | Directed Acyclic Graphs | en_US |
| dc.type | info:eu-repo/semantics/dataset | en_US |
| dc.identifier.doi | 10.18745/ds.16553 | |
| herts.preservation.rarelyaccessed | true | |
