A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
On the Page Number of Upward Planar Directed Acyclic Graphs
2013
Journal of Graph Algorithms and Applications
In this paper we study the page number of upward planar directed acyclic graphs. We prove that: (1) the page number of any n-vertex upward planar triangulation G whose every maximal 4-connected component has page number k is at most min{O(k log n), O(2 k )}; (2) every upward planar triangulation G with o( n log n ) diameter has o(n) page number; and (3) every upward planar triangulation has a vertex ordering with o(n) page number if and only if every upward planar triangulation whose maximum degree is O( √ n) does.
doi:10.7155/jgaa.00292
fatcat:5svtdpqmcjc2rjojjasowvjbze