Assertion: graph's edge | /r/CapableOf | contribute to the term
Facets:
value: in the sum
type: OTHER
Source sentences:
text: Finding each successively removed vertex v and adjusting the cells of D containing the neighbors of v take time proportional to the value of d v at that step; but the sum of these values is the number of edges of the graph (each edge contributes to the term in the sum for the later of its two endpoints) so the total time is linear.