# David Eppstein - Publications

##

**Finding common ancestors and disjoint paths in DAGs**.

D. Eppstein.

Tech. Rep. 95-52, ICS, UCI, 1995.
This paper describes algorithms for finding pairs of vertex-disjoint
paths in a DAG, either connecting two given nodes to a common
ancestor, or connecting two given pairs of terminals.
The main results were merged into the journal version of
"Finding the *k* shortest paths".

(BibTeX)

Publications –
David Eppstein –
Theory Group –
Inf. & Comp. Sci. –
UC Irvine

Semi-automatically filtered
from a common source file.