Assertion: algorithm | /r/CapableOf | meet the time bounds
Facets:
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.