3008 search results - page 114 / 602 » Independence in connected graphs |
169
click to vote
JCO
2008
15 years 6 months ago
2008
We study Connected Facility Location problems. We are given a connected graph G = (V, E) with nonnegative edge cost ce for each edge e E, a set of clients D V such that each cli...
165
click to vote
CSR
2008
Springer
15 years 8 months ago
2008
Springer
A function f of a graph is called a complete graph invariant if two given graphs G and H are isomorphic exactly when f(G) = f(H). If additionally, f(G) is a graph isomorphic to G, ...
162
click to vote
IPPS
2007
IEEE
16 years 20 days ago
2007
IEEE
The GCA (Global Cellular Automata) model consists of a collection of cells which change their states synchronously depending on the states of their neighbors like in the classical...
194
click to vote
HICSS
2002
IEEE
15 years 11 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...
157
click to vote
IPCO
2004
15 years 7 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...