65 search results - page 8 / 13 » On the Value of a Random Minimum Weight Steiner Tree |
82
Voted
FCT
2009
Springer
15 years 4 months ago
2009
Springer
We study the empire colouring problem (as defined by Percy Heawood in 1890) for maps whose dual planar graph is a tree, with empires formed by exactly r countries. We prove that, ...
GECCO
2005
Springer
15 years 2 months ago
2005
Springer
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
FUN
2007
Springer
15 years 3 months ago
2007
Springer
We analyse transports between leaves in an edge-weighted tree. We prove under which conditions there exists a transport matching the weights of a given tree. We use this to compute...
158
click to vote
ICDE
2007
IEEE
15 years 10 months ago
2007
IEEE
It is widely realized that the integration of database and information retrieval techniques will provide users with a wide range of high quality services. In this paper, we study ...
SODA
1998
ACM
14 years 10 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...