Difference between revisions of "Publications/newton.16.dag.report"
From LRDE
(Created page with "{{Publication | published = true | date = 2016-11-17 | lrdekeywords = CLOS, graph, lisp | lrdenewsdate = 2016-11-17 | lrdepaper = http://www.lrde.epita.fr/dload/papers/newton....") |
|||
| Line 10: | Line 10: | ||
| institution = LRDE |
| institution = LRDE |
||
| address = Paris, France |
| address = Paris, France |
||
| − | | abstract = Given a directed acyclic graph (DAG) and two arbitrary nodes, find maximal common joins of the two nodes. |
+ | | 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. |
| type = techreport |
| type = techreport |
||
| id = newton.16.dag.report |
| id = newton.16.dag.report |
||
Revision as of 17:38, 19 January 2017
- 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.}
}