Dynamic Embeddings of Dynamic Single-Source Upward Planar Graphs

Ivor van der Hoog, Irene Parada, Eva Rotenberg

A directed graph $G$ is upward planar if it admits a planar embedding such that each edge is $y$-monotone. Unlike planarity testing, upward planarity testing is NP-hard except in r…