Please help transcribe this video using our simple transcription tool. You need to be logged in to do so.

Description

allows us to settle a number of both old and recent open problemsWe prove that planar graphs have $O(log^4 n)$ queue number, thus improving upon the previous $O(sqrt n)$ upper bound. Consequently, planar graphs admit 3D straight-line crossing-free grid drawings in $O(n log^c n)$ volume, for some constant $c$, thus improving upon the previous $O(n^{3/2})$ upper bound.

Questions and Answers

You need to be logged in to be able to post here.