Optimal per-edge processing times in the semi-streaming model

We present semi-streaming algorithms for basic graph problems that have optimal per-edge processing times and therefore surpass all previous semi-streaming algorithms for these tasks. The semi-streaming model, which is appropriate when dealing with massive graphs, forbids random access to the input...

Full description

Saved in:

Bibliographic Details
Published in:	Information processing letters Vol. 104; no. 3; pp. 106 - 112
Main Author:	Zelke, Mariano
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 31.10.2007 Elsevier Science Elsevier Sequoia S.A
Subjects:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Combinatorics Combinatorics. Ordered structures Computer science; control theory; systems Exact sciences and technology Graph algorithms Graph theory Graphs Information processing Information retrieval. Graph Mathematical models Mathematics Miscellaneous Per-edge processing time Random access memory Sciences and techniques of general use Streaming algorithms Studies Theoretical computing Streaming algorithms Graph algorithms Per-edge processing time Access time Vertex Computer theory Random access memory Processing time Computing Random graph Input Graph connectivity Information processing Fast algorithm Algorithm analysis Graph algorithm
ISSN:	0020-0190, 1872-6119
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!