Assertion: algorithm's complexity | /r/HasProperty | expressed in alternative way
Facets:
value: for very large graphs
type: PURPOSE
Source sentences:
text: The complexity of this algorithm can be expressed in an alternative way for very large graphs: when C* is the length of the shortest path from the start node to any node satisfying the "goal" predicate, each edge has cost at least ε, and the number of neighbors per node is bounded by b, then the algorithm's worst-case time and space complexity are both in