Sciweavers

367 search results - page 25 / 74
» Set connectivity problems in undirected graphs and the direc...
Sort
View
APPROX
2010
Springer
154views Algorithms» more  APPROX 2010»
13 years 10 months ago
The Checkpoint Problem
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
ICDE
2007
IEEE
111views Database» more  ICDE 2007»
14 years 9 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...
IPPS
2007
IEEE
14 years 2 months ago
A Multi-Level Parallel Implementation of a Program for Finding Frequent Patterns in a Large Sparse Graph
Graphs capture the essential elements of many problems broadly defined as searching or categorizing. With the rapid increase of data volumes from sensors, many application discipl...
Steve Reinhardt, George Karypis
INFOCOM
2011
IEEE
12 years 12 months ago
Connected coverage in wireless networks with directional antennas
—In this paper, we address a new unexplored problem - what are the optimal patterns to achieve connected coverage in wireless networks with directional antennas. As their name im...
Zuoming Yu, Jin Teng, Xiaole Bai, Dong Xuan, Weiji...
SODA
1997
ACM
93views Algorithms» more  SODA 1997»
13 years 9 months ago
Fast Approximate Graph Partitioning Algorithms
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
Guy Even, Joseph Naor, Satish Rao, Baruch Schieber