<aside>

============== Under Construction ==============

</aside>

Untitled

time-ordered graph (2012),

1) Vertex-Expansion

Turn every vertex into its appearance at each (relevant) time step and draw the connections at the right places ‘in time’. So $v$ turns into $v_1, v_2, \dots, v_\tau$ and unused clones may get deleted.

Static Expansion / (Simplified) Time Expanded Graph (S)TEG

Directed

Undirected

2) Edge-Expansion

3) Graph Transformation