Testing Upward Planarity of Partial 2-Trees

08/26/2022

∙

by   Steven Chaplick, et al.

∙

0

∙

share

We present an O(n^2)-time algorithm to test whether an n-vertex directed partial 2-tree is upward planar. This result improves upon the previously best known algorithm, which runs in O(n^4) time.