All Questions
Tagged with applied-mathematics computational-complexity
1 question
3
votes
1
answer
80
views
On the relationship between graph isomorphism and equivalence in ETL workflow dependency graphs
$\newcommand{\inn}{\mathrm{in}}\newcommand{\out}{\mathrm{out}}$Let $G = (V, E)$ and $G' = (V', E')$ be two DAGs representing dependency graphs of ETL workflows. Each node $v \in V$ (or $v' \in V'$) ...
user530362