Finding maximal common joins in a DAG

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

• Paper

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.}
}