File

Revision history of "Newton.16.dag.report.pdf"

Diff selection: Mark the radio boxes of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

  • curprev 16:29, 17 November 2016Jim Newton talk contribs 292 bytes +292 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 ...