Difference between revisions of "Publications/newton.16.dag.report"
From LRDE
| Line 7: | Line 7: | ||
| lrdeprojects = Climb |
| lrdeprojects = Climb |
||
| authors = Jim Newton |
| authors = Jim Newton |
||
| − | | title = Finding |
+ | | title = Finding Maximal Common Joins in a DAG |
| institution = LRDE |
| institution = LRDE |
||
| address = Paris, France |
| address = Paris, France |
||
| Line 16: | Line 16: | ||
@TechReport<nowiki>{</nowiki> newton.16.dag.report, |
@TechReport<nowiki>{</nowiki> newton.16.dag.report, |
||
author = <nowiki>{</nowiki>Jim Newton<nowiki>}</nowiki>, |
author = <nowiki>{</nowiki>Jim Newton<nowiki>}</nowiki>, |
||
| − | title = <nowiki>{</nowiki>Finding |
+ | title = <nowiki>{</nowiki>Finding Maximal Common Joins in a <nowiki>{</nowiki>DAG<nowiki>}</nowiki><nowiki>}</nowiki>, |
institution = <nowiki>{</nowiki>LRDE<nowiki>}</nowiki>, |
institution = <nowiki>{</nowiki>LRDE<nowiki>}</nowiki>, |
||
year = 2016, |
year = 2016, |
||
Latest revision as of 12:22, 3 December 2022
- Authors
- Jim Newton
- Place
- Paris, France
- Type
- techreport
- Projects
- Climb
- Keywords
- CLOS, graph, lisp
- Date
- 2016-11-17
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.
Documents
Bibtex (lrde.bib)
@TechReport{ newton.16.dag.report,
author = {Jim Newton},
title = {Finding Maximal Common Joins in a {DAG}},
institution = {LRDE},
year = 2016,
address = {Paris, France},
month = nov,
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.}
}