19 search results - page 2 / 4 » On the Probabilistic min spanning tree problem |
DIALM
2008
ACM
13 years 7 months ago
2008
ACM
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
FLAIRS
2001
13 years 7 months ago
2001
Decisionand optimizationproblemsinvolvinggraphsarise in manyareas of artificial intelligence, including probabilistic networks, robot navigation, and network design. Manysuch prob...
JCO
2007
13 years 5 months ago
2007
Let G = (V, E) be a connected multigraph, whose edges are associated with labels specified by an integer-valued function L : E → N. In addition, each label ℓ ∈ N has a non-...
SODA
2007
ACM
13 years 7 months ago
2007
ACM
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a ...
EMNLP
2007
13 years 7 months ago
2007
This paper proposes a tree kernel with contextsensitive structured parse tree information for relation extraction. It resolves two critical problems in previous tree kernels for r...