2137 search results - page 59 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
212
Voted
ICDE
1998
IEEE
16 years 3 months ago
1998
IEEE
Discovery of functionaldependencies from relations has been identified as an important database analysis technique. In this paper, we present a new approach for finding functional...
106
Voted
IJCAI
2007
15 years 3 months ago
2007
There is currently much interest in using external memory, such as disk storage, to scale up graph-search algorithms. Recent work shows that the local structure of a graph can be ...
145
Voted
SIROCCO
2010
15 years 3 months ago
2010
We consider asynchronous message-passing systems in which some links are timely and processes may crash. Each run defines a timeliness graph among correct processes: (p, q) is an e...
157
Voted
SMC
2010
IEEE
15 years 2 days ago
2010
IEEE
Abstract--Finding the longest simple path in a generic undirected graph is a challenging issue that belongs to the NPComplete class of problems. Four approaches based on genetic al...
120
Voted
OPODIS
2007
15 years 3 months ago
2007
Abstract. We consider the distributed construction of a minimum weight 2edge-connected spanning subgraph (2-ECSS) of a given weighted or unweighted graph. A 2-ECSS of a graph is a ...