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.
Date Submitted:2015Processing complex computations on high volume streaming data in real time is a challenge for many organizational data processing systems. Such systems should produce results with low latency while processing billions of ...
Date Submitted:2014There are many open problems concerning strongly regular graphs: proving non-existence for parameters where none are known; proving existence for parameters where none are known; constructing more parameters where examples ...
Date:undated24 - Comparison of 100 laboratory tests for weirs and improved Venturi flumes. In this it is notes that the flume is approximately one-half as accurate as the weir: however, under field conditions it would be expected that ...