Newton.16.dag.report.pdf
From LRDE
Newton.16.dag.report.pdf (file size: 456 KB, MIME type: application/pdf)
Finding maximal common joins in a DAG
Abstract: Given a directed acyclic graph (DAG) and two arbitrary nodes, find maximal common joins of the two nodes. In this technical report I suggest an algorithm for efficiently calculating the minimal set of nodes which derive from a pair of nodes.
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Dimensions | User | Comment | |
|---|---|---|---|---|
| current | 16:29, 17 November 2016 | (456 KB) | Jim Newton (talk | contribs) | Finding maximal common joins in a DAG Abstract: Given a directed acyclic graph (DAG) and two arbitrary nodes, find maximal common joins of the two nodes. In this technical report I suggest an algorithm for efficiently calculating the minimal set of ... |
You cannot overwrite this file.
File usage
There are no pages that use this file.