eldorado.tu-dortmund.de/server/api/core/bitstreams/62f7aab8-59d0-4d9d-a0ad-3ce598ae484f/content
X1 Y(i)
1 is also connected inX2 Y(i) 2 . This implies that ifei+1 is added toY(i)
2 , it is also added toY(i) 1 , so that the full
follower•s responseY(m) 2 = Y2 to X2 is contained inY(m)
1 = Y1. We [...] derive that alsoX2 Y(iŠ1) 2 connectsv to vi andw to wi. Hence, eitherv andw are already
connected byX2 Y(iŠ1) 2 , in which case we are done, orvi andwi are not connected byX2 Y(iŠ1)
2 . In the latter [...] algorithm anyway, leading to forestsY1 andY2.
Lemma 3. Given two cycle-free edge sets X1 ⊆ X2 ⊆ E𝓁, let Y1,Y2 ⊆ Ef be the corresponding follower•s responses. Then Y1 ⊇ Y2.
Proof. Let Ef = { e1, ƒ ,em} , wheree1 …
