Results 1 
2 of
2
Engineering an External Memory Minimum Spanning Tree Algorithm
 IN PROC. 3RD IFIP INTL. CONF. ON THEORETICAL COMPUTER SCIENCE
, 2004
"... We develop an external memory algorithm for computing minimum spanning trees. The algorithm is considerably simpler than previously known external memory algorithms for this problem and needs a factor of at least four less I/Os for realistic inputs. Our implementation indicates that this algorithm ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
We develop an external memory algorithm for computing minimum spanning trees. The algorithm is considerably simpler than previously known external memory algorithms for this problem and needs a factor of at least four less I/Os for realistic inputs. Our implementation indicates that this algorithm processes graphs only limited by the disk capacity of most current machines in time no more than a factor 2–5 of a good internal algorithm with sufficient memory space.
Tradeoff algorithms in streaming models
, 2006
"... In this report I will focus on the research activity carried on during the first two years of my PhD program, at the University of Rome “La Sapienza”, in the field of massive data sets, with particular emphasis on the streaming computational model: in this model data stored in external memory can be ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this report I will focus on the research activity carried on during the first two years of my PhD program, at the University of Rome “La Sapienza”, in the field of massive data sets, with particular emphasis on the streaming computational model: in this model data stored in external memory can be accessed only sequentially, in one or several passes, and is processed using an amount of internal memory that is small, compared to the size of the external memory. First several computational models for massive data sets will be introduced and motivated, then an overview of the results obtained within the framework of those models will be given, mainly relatively to a specific, but relevant class of problems (namely, graph problems). A presentation of the results obtained during these two years will follow, and then work in progress and future research directions will be outlined. 1