140 search results - page 11 / 28 » Computing Minimum Spanning Trees with Uncertainty |
130
click to vote
PDCAT
2005
Springer
15 years 5 months ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
PDPTA
2003
15 years 1 months ago
2003
We investigate the management of flocking mobile objects using a parallel message-passing computer cluster. An octree, a data structure well-known for use in managing a 3D space, ...
VTC
2010
IEEE
14 years 10 months ago
2010
IEEE
—Nonparametric belief propagation (NBP) is one of the best-known methods for cooperative localization in sensor networks. It is capable to provide information about location esti...
WAOA
2007
Springer
15 years 5 months ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
ICPR
2006
IEEE
16 years 23 days ago
2006
IEEE
This paper exploits the properties of the commute time for the purposes of graph matching. Our starting point is the random walk on the graph, which is determined by the heat-kern...