 |
 |
15 of 18 |  |
 |
 |
MIT
2-Respected Trees
l
Cut corresponds to two
subtrees:
l
n²
table entries
l
fill in O
(n
2
) time by
treefix
computations
(
)
(
)
(
)
(
)
C
v
w
C
v
C
w
C
v
w
¯
¯
¯
¯
¯
¯
È
=
+
-
2
,
v
w
keep
discard