Assertion: algorithm | /r/HasProperty | fast
Facets:
value: very
type: DEGREE
value: for sparse graphs
type: PURPOSE
value: usually
type: DEGREE
Source sentences:
text: In terms of their asymptotic time complexity, these three algorithms are equally fast for sparse graphs, but slower than other more sophisticated algorithms.
text: As the algorithm is usually fast, it is common to run it multiple times with different starting conditions.
text: The algorithm is very fast.
text: Since we can use the low rank approximations of U, S, and V, this algorithm is quite fast, and Brand shows that the entire SVD can be built in this manner in O(mnk)