Faster graph algorithms via switching classes
MetadataShow full item record
The runtime of an algorithm is intimately related to how an instance is represented. Recall that the runtimes of the first generation of graph algorithms were expressed as functions of n := |V|. This analysis was natural since at this time graphs were represented in n2 space via their adjacency matrix. It was soon noticed that if m := |E| = o(n2), then a variety of graph algorithms could be sped-up by computing the adjacency-list from the adjacency matrix, then running the algorithm on the more efficient adjacency-list representation. This motivated the introduction of m to the runtime of graph ...
Showing items related by title, author, creator and subject.
A performance study of an implementation of the push-relabel maximum flow algorithm in Apache Spark's GraphX Contributor:Langewisch, Ryan P.;
Date Submitted:2015GraphX is an API for graph computation built upon Apache Spark, a fast and generalized engine for large-scale data processing in the cloud. While the popularity of Spark and GraphX is growing, the relatively young technology ...
Date Submitted:2013Vector field visualization has been a popular research topic in the past few decades. Vector field features have traditionally been defined as trajectories with certain special properties. Examples of such features include ...