Euclidean minimum spanning tree: Difference between revisions

Content deleted Content added
m clean up, typo(s) fixed: a edge → an edge
edlinks
Line 184:
| last = Ambühl | first = Christoph
| editor1-last = Caires | editor1-first = Luís
| editor2-last = Italiano | editor2-first = Giuseppe F. | editor2-link = Giuseppe F. Italiano
| editor3-last = Monteiro | editor3-first = Luís
| editor4-last = Palamidessi | editor4-first = Catuscia | editor4-link = Catuscia Palamidessi
| editor5-last = Yung | editor5-first = Moti
| contribution = An optimal bound for the MST algorithm to compute energy efficient broadcast trees in wireless networks