Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

134

Voted

CCCG
2006

133views Computational Geometry» more CCCG 2006»

Realization of Degree 10 Minimum Spanning Trees in 3-Space

15 years 4 months ago

Realization of Degree 10 Minimum Spanning Trees in 3-Space

Download www.cs.mcgill.ca

We show that any tree whose maximum degree is at most 10 can be drawn in 3-space such that it is the minimum spanning tree of its vertices.

James A. King

Real-time Traffic

CCCG 2006 | CCCG 2007 | Maximum Degree | Minimum Spanning Tree |

claim paper

Related Content

» Approximating minimum bounded degree spanning trees to within one of optimal

» Approximating the Minimum Spanning Tree Weight in Sublinear Time

» Relay Placement for Higher Order Connectivity in Wireless Sensor Networks

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2006
Where	CCCG
Authors	James A. King

Comments (0)