255 search results - page 4 / 51 » Spanning Trees and Function Classes |
ASIAMS
2007
IEEE
14 years 4 days ago
2007
IEEE
The tree structure has received much interest as a versatile architecture for a large class of parallel processing applications. Spanning trees in particular are essential tools f...
CATS
1998
13 years 7 months ago
1998
Let G(V, E) be a weighted, undirected, connected simple graph with n vertices and m edges. The k most vital edge problem with respect to minimum spanning trees is to find a set S o...
FOCS
1992
IEEE
13 years 10 months ago
1992
IEEE
We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, we obtain efficient dyna...
ICALP
2000
Springer
13 years 9 months ago
2000
Springer
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
ICPR
2006
IEEE
14 years 6 months 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...