4 search results - page 1 / 1 » Realization of Degree 10 Minimum Spanning Trees in 3-Space |
CCCG
2006
14 years 8 days ago
2006
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.
STOC
2007
ACM
14 years 11 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
ICALP
2001
Springer
14 years 3 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
INFOCOM
2006
IEEE
14 years 4 months ago
2006
IEEE
Abstract— Sensors typically use wireless transmitters to communicate with each other. However, sensors may be located in a way that they cannot even form a connected network (e.g...