11381 search results - page 50 / 2277 » Connectivity |
ALGORITHMICA
2004
14 years 9 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 ...
CORR
2004
Springer
14 years 9 months ago
2004
Springer
We describe a simple algorithm based on a Markov chain process to generate simply connected acyclic directed graphs over a fixed set of vertices. This algorithm is an extension of...
COMBINATORICS
2002
14 years 9 months ago
2002
We present a simple heuristic for finding a small connected dominating set of cubic graphs. The average-case performance of this heuristic, which is a randomised greedy algorithm,...
CGF
2007
14 years 9 months ago
2007
We present a new, single-rate method for compressing the connectivity information of a connected 2-manifold triangle mesh with or without boundary. Traditional compression schemes...
IEEEIAS
2009
IEEE
15 years 4 months ago
2009
IEEE
: A common technique hacker use is to route their traffic through a chain of stepping-stone hosts. It is generally agreed that there is no valid reason to use a long connection cha...