Skip to main content
Article thumbnail
Location of Repository

Planar Orientations with Low Out-Degree and Compaction of Adjacency Matrices

By Marek Chrobak and David Eppstein

Abstract

We consider the problem of orienting the edges of a planar graph in such a way that the out-degree of each vertex is minimized. If, for each vertex v, the out-degree is at most d, then we say that such an orientation is d-bounded. We prove the following results: ffl Each planar graph has a 5-bounded acyclic orientation, which can be constructed in linear time. ffl Each planar graph has a 3-bounded orientation, which can be constructed in linear time. ffl A 6-bounded acyclic orientation, and a 3-bounded orientation, of each planar graph can each be constructed in parallel time O(log n log n) on an EREW PRAM, using O(n= log n log n) processors. As an application of these results, we present a data structure such that each entry in the adjacency matrix of a planar graph can be looked up in constant time. The data structure uses linear storage, and can be constructed in linear time. Department of Mathematics and Computer Science, University of California, Riverside, CA 92521. On..

Year: 1991
OAI identifier: oai:CiteSeerX.psu:10.1.1.31.2308
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.ucr.edu/~marek/p... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.