4865 search results - page 94 / 973 » The Complexity of Graph Connectivity |
FMCAD
2000
Springer
14 years 1 months ago
2000
Springer
We present a symbolic algorithm for strongly connected component decomposition. The algorithm performs (n log n) image and preimage computations in the worst case, where n is the n...
COCOA
2008
Springer
14 years 4 days ago
2008
Springer
In the Connected Facility Location(ConFL) problem, we are given a graph G = (V, E) with nonnegative edge cost ce on the edges, a set of facilities F V , a set of demands, i.e., cl...
ALGORITHMICA
2004
13 years 10 months ago
2004
We consider the Connected Facility Location problem. We are given a graph G = (V, E) with costs {ce} on the edges, a set of facilities F V , and a set of clients D V . Facility ...
PSTV
1993
13 years 11 months ago
1993
We present a new algorithm that can be used for solving the model−checking problem for linear−time temporal logic. This algorithm can be viewed as the combination of two exist...
AUTOMATICA
2011
13 years 5 months ago
2011
Iterative distributed algorithms are studied for computing arithmetic averages over networks of agents connected through memoryless broadcast erasure channels. These algorithms do...