Sciweavers

2487 search results - page 178 / 498
» Partitions of Graphs into Trees
Sort
View
169
Voted
COR
2008
142views more  COR 2008»
15 years 3 months ago
Modeling and solving the rooted distance-constrained minimum spanning tree problem
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
Luis Gouveia, Ana Paias, Dushyant Sharma
129
Voted
JOIN
2007
91views more  JOIN 2007»
15 years 3 months ago
An Optimal Rebuilding Strategy for an Incremental Tree Problem
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
Nicolas Thibault, Christian Laforest
217
Voted
ICDE
2007
IEEE
111views Database» more  ICDE 2007»
16 years 5 months ago
Finding Top-k Min-Cost Connected Trees in Databases
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 ...
Bolin Ding, Jeffrey Xu Yu, Shan Wang, Lu Qin, Xiao...
140
Voted
VLDB
1995
ACM
132views Database» more  VLDB 1995»
15 years 7 months ago
Coloring Away Communication in Parallel Query Optimization
We address the problem of finding parallel plans for SQL queries using the two-phase approach of join ordering and query rewrite (JOQR) followed by parallelization. We focus on t...
Waqar Hasan, Rajeev Motwani
134
Voted
JHSN
2007
165views more  JHSN 2007»
15 years 3 months ago
Slack allocation techniques for intra-path load balancing
: Network resource provisioning techniques need to perform both inter-path and intra-path load balancing to maximize the network’s resource usage efficiency while supporting end...
Kartik Gopalan, Tzi-cker Chiueh, Yow-Jian Lin