Assertion: algorithm | /r/CapableOf | run in linear time
Facets:
value: more simply
type: DEGREE
Source sentences:
text: However, for graphs that are sufficiently dense, Prim's algorithm can be made to run in linear time, meeting or improving the time bounds for other algorithms.
text: For graphs of even greater density (having at least |V|c edges for some c > 1), Prim's algorithm can be made to run in linear time even more simply, by using a d-ary heap in place of a Fibonacci heap.