- Home
- Wintersemester 2020/2021
- Master- und Aufbaustudiengänge
- WS20_AdvAlg
- Literatur und zusätzliche Materialien
- [BS '05] On the computational complexity of the rooted subtree prune and regraft distance
[BS '05] On the computational complexity of the rooted subtree prune and regraft distance
Click https://link.springer.com/article/10.1007/s00026-004-0229-z link to open resource.