Results 1 
3 of
3
Algorithmic Theory of Random graphs
, 1997
"... The theory of random graphs has been mainly concerned with structural properties, in particular the most likely values of various graph invariants  see Bollob`as [21]. There has been increasing interest in using random graphs as models for the average case analysis of graph algorithms. In this pap ..."
Abstract

Cited by 24 (1 self)
 Add to MetaCart
The theory of random graphs has been mainly concerned with structural properties, in particular the most likely values of various graph invariants  see Bollob`as [21]. There has been increasing interest in using random graphs as models for the average case analysis of graph algorithms. In this paper we survey some of the results in this area. 1 Introduction The theory of random graphs as initiated by Erdos and R'enyi [52] and developed along with others, has been mainly concerned with structural properties, in particular the most likely values of various graph invariantss  see Bollob`as [21]. There has been increasing interest in using random graphs as models for the average case analysis of graph algorithms. We would like in this paper to survey some of the results in this area. We hope to be fairly comprehensive in terms of the areas we tackle and so depth will be sacrificed in favour of breadth. One attractive feature of average case analysis is that it banishes the pessimism o...
An Experimental Study on Transitive Closure Representations
"... We present two new compact transitive closure representations. The first uses intervals and the second chains to store the closure. Both representations are based on previous methods designed for acyclic graphs. The new representations are applicable to all kinds of graphs, and can be efficiently co ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present two new compact transitive closure representations. The first uses intervals and the second chains to store the closure. Both representations are based on previous methods designed for acyclic graphs. The new representations are applicable to all kinds of graphs, and can be efficiently constructed during a single traversal of the input graph. We compared experimentally the average size of these representations and traditional list based representations. The inputs were random graphs. The interval representation outperformed the other representations: it typically required a space at most linear to the number of vertices of the input graph. The chain representation did not save much space compared to a list representation. We also studied the complexity of constructing the interval representation. Our results indicate that in the models of random graphs that we used, the transitive closure can typically be computed in a time linear to the size of the input graph when the interv...