785 search results - page 8 / 157 » Embedding a Forest in a Graph |
CATS
2007
13 years 9 months ago
2007
ARSCOM
2004
13 years 7 months ago
2004
ESA
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. The depth of a planar embedding is a measure of the topological nesting of the biconnected components of the graph. Minimizing the depth of planar embeddings has importan...
ISAAC
1997
Springer
13 years 12 months ago
1997
Springer
We present a randomized EREW PRAM algorithm to nd a minimum spanning forest in a weighted undirected graph. On an n-vertex graph the algorithm runs in o((logn)1+ ) expected time f...
RTCSA
1998
IEEE
14 years 14 hour ago
1998
IEEE