1798 search results - page 17 / 360 » A Tree for All Seasons |
IANDC
2011
13 years 2 months ago
2011
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...
EOR
2006
13 years 7 months ago
2006
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
including the one proposed in [5]. Minieka showed that all the eight problems can be solved in polynomial time except the one of finding the maximum distancesum tree of a specified...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
For a rectilinear Steiner tree T with a root, define its k-th moment Mk(T) = T (dT (u))k du, where the integration is over all edges of T, dT (u) is the length of the unique path ...
ALGORITHMICA
2008
13 years 7 months ago
2008
Let T be a spanning tree of a graph G and S V (G) be a set of sources. The routing cost of T is the total distance from all sources to all vertices. For an edge e of T, the swap ...