Loading...
research article
On The Queue Number Of Planar Graphs
We prove that planar graphs have O(log(2) n) queue number, thus improving upon the previous O(root n) upper bound. Consequently, planar graphs admit three-dimensional straight-line crossing-free grid drawings in O(n log(8) n) volume, thus improving upon the previous O(n(3/2)) upper bound.
Type
research article
Web of Science ID
WOS:000328889400009
Authors
Publication date
2013
Publisher
Published in
Volume
42
Issue
6
Start page
2243
End page
2285
Peer reviewed
REVIEWED
EPFL units
Available on Infoscience
February 17, 2014
Use this identifier to reference this record