4865 search results - page 119 / 973 » The Complexity of Graph Connectivity |
134
click to vote
HICSS
2002
IEEE
15 years 7 months ago
2002
IEEE
Abstract. In this paper we describe several new clustering algorithms for nodes in a mobile ad hoc network. The main contribution is to generalize the cluster definition and forma...
114
click to vote
IPCO
2004
15 years 4 months ago
2004
We consider the problems of enumerating all minimal strongly connected subgraphs and all minimal dicuts of a given directed graph G = (V, E). We show that the first of these proble...
117
click to vote
ICCV
2009
IEEE
15 years 19 days ago
2009
IEEE
We describe an energy minimization algorithm for functions defined on 4-connected lattices, of the type usually encountered in problems involving images. Such functions are often ...
STOC
2006
ACM
16 years 3 months ago
2006
ACM
Let G be an n-vertex graph that has a vertex separator of size k that partitions the graph into connected components of size smaller
127
click to vote
PERCOM
2004
ACM
16 years 2 months ago
2004
ACM
We investigate the theoretical limits of positioning algorithms. In particular, we study scenarios where the nodes do not receive anchors directly (multi-hop) and where no physica...