Max-Planck-Institut für Informatik: Homemehlhorn/ftp/SteinerTrees.pdf · 2006-08-18 · all...
4
Transcript of Max-Planck-Institut für Informatik: Homemehlhorn/ftp/SteinerTrees.pdf · 2006-08-18 · all...
![Page 1: Max-Planck-Institut für Informatik: Homemehlhorn/ftp/SteinerTrees.pdf · 2006-08-18 · all Steiner trees for G and S. This minimal dis- tance is called Dmm(G). Note that vertices](https://reader034.fdocuments.net/reader034/viewer/2022050100/5f3f63b790ab00196261689f/html5/thumbnails/1.jpg)
![Page 2: Max-Planck-Institut für Informatik: Homemehlhorn/ftp/SteinerTrees.pdf · 2006-08-18 · all Steiner trees for G and S. This minimal dis- tance is called Dmm(G). Note that vertices](https://reader034.fdocuments.net/reader034/viewer/2022050100/5f3f63b790ab00196261689f/html5/thumbnails/2.jpg)
![Page 3: Max-Planck-Institut für Informatik: Homemehlhorn/ftp/SteinerTrees.pdf · 2006-08-18 · all Steiner trees for G and S. This minimal dis- tance is called Dmm(G). Note that vertices](https://reader034.fdocuments.net/reader034/viewer/2022050100/5f3f63b790ab00196261689f/html5/thumbnails/3.jpg)
![Page 4: Max-Planck-Institut für Informatik: Homemehlhorn/ftp/SteinerTrees.pdf · 2006-08-18 · all Steiner trees for G and S. This minimal dis- tance is called Dmm(G). Note that vertices](https://reader034.fdocuments.net/reader034/viewer/2022050100/5f3f63b790ab00196261689f/html5/thumbnails/4.jpg)