Abstract
Purchase PDF (1074 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (2)
Purchase PDF (335 K)
doi:10.1016/S0166-218X(97)00007-3 
Copyright © 1997 Published by Elsevier Science B.V.
Contribution
Efficient computation of implicit representations of sparse graphs*1
Received 1 June 1995;
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
The problem of finding an implicit representation for a graph such that vertex adjacency can be tested quickly is fundamental to all graph algorithms. In particular, it is possible to represent sparse graphs on n vertices using O(n) space such that vertex adjacency is tested in O(l) time. We show here how to construct such a representation efficiently by providing simple and optimal algorithms, both in a sequential and a parallel setting. Our sequential algorithm runs in O(n) time. The parallel algorithm runs in O(log n) time using O(n/log n) CRCW PRAM processors, or inO(log n log* n) time using O(n/log n log* n) EREW PRAM processors. Previous results for this problem are based on matroid partitioning and thus have a high complexity.
Author Keywords: Implicit representation; Sparse graphs; Arboricity; Graph algorithms; Parallel computation
