Planar orientations with low out-degree and compaction of adjacency matrices (Q1178710): Difference between revisions

A \(d\)-bounded orientation of an undirected graph is an orientation of its edges so that each vertex has outdegree at most \(d\). It is shown that planar graphs have 3-bounded orientations and they have 5-bounded acyclic orientations, both of which can be constructed in linear time. Parallel algorithms are given for finding 3-bounded orientations and 6-bounded acyclic orientations of planar graphs that do not require a planar embedding to be provided. Similar results are established for outerplanar and series-parallel graphs. Applications to compact data structures for representing planar graphs, using linear space but providing a constant time method for deciding adjacency of two vertices, are discussed.