1760 search results - page 185 / 352 » Connected Set Cover Problem and Its Applications |
IWPEC
2004
Springer
14 years 1 months ago
2004
Springer
Consider the following problem, that we call “Chordless Path through Three Vertices” or CP3V, for short: Given a simple undirected graph G = (V, E), a positive integer k, and t...
COMBINATORICA
2007
13 years 7 months ago
2007
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
DAM
2010
13 years 8 months ago
2010
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
SECON
2010
IEEE
13 years 6 months ago
2010
IEEE
Nodes in a cognitive radio mesh network may select from a set of available channels to use provided they do not interfere with primary users. This ability can improve overall netwo...
STEP
2003
IEEE
14 years 1 months ago
2003
IEEE
The adoption of the Internet technologies favors the diffusion of Web and Grid-based applications. However, the development of new applications exploiting the modern interfaces an...