621 search results - page 28 / 125 » Efficient algorithms for minimizing tree pattern queries |
DPD
2002
13 years 7 months ago
2002
A major cost in executing queries in a distributed database system is the data transfer cost incurred in transferring relations (fragments) accessed by a query from different sites...
SRDS
1998
IEEE
14 years 9 days ago
1998
IEEE
We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
AUTONOMICS
2008
ACM
13 years 10 months ago
2008
ACM
Multicast trees are used in a variety of applications, such as publish/subscribe systems or content distribution networks. Existing algorithms for ad-hoc networks typically produc...
GLOBECOM
2007
IEEE
14 years 2 months ago
2007
IEEE
—This paper focuses on routing tree construction problem and its influence on the performance of utilizing centralized scheduling in IEEE 802.16 mesh networks. We apply three rou...