Login / Signup

A Sublinear Bound on the Page Number of Upward Planar Graphs.

Paul JungeblutLaura MerkerTorsten Ueckerdt
Published in: SODA (2022)
Keyphrases
  • planar graphs
  • computational complexity
  • lower bound
  • special case
  • image segmentation
  • probabilistic model
  • upper bound
  • maximum likelihood
  • closed form