JCO
2007
13 years 11 months ago
2007
In adversarial environments, disabling the communication capabilities of the enemy is a high priority. We introduce the problem of determining the optimal number and locations for ...
JCO
2007
13 years 11 months ago
2007
JCO
2007
13 years 11 months ago
2007
Let G = (V, E) be a connected multigraph, whose edges are associated with labels specified by an integer-valued function L : E → N. In addition, each label ℓ ∈ N has a non-...
JCO
2007
13 years 11 months ago
2007
Abstract The wide diameter of a graph is an important parameter to measure faulttolerance of interconnection network. This paper proves that for any two vertices in de Bruijn undir...
JCO
2007
13 years 11 months ago
2007
JCO
2007
13 years 11 months ago
2007
The problem of radio channel assignments with multiple levels of interference can be modelled using graph theory. The theory of integer vertex-labellings of graphs with distance c...
JCO
2007
13 years 11 months ago
2007
Let Kn1,n2,...,nm be a complete m-partite graph with partite sets of sizes n1,n2,...,nm. A complete m-partite graph is balanced if each partite set has n vertices. We denote this c...
JCO
2007
13 years 11 months ago
2007
We study a variant of classical scheduling, which is called scheduling with “end of sequence” information. It is known in advance that the last job has the longest processing ...
JCO
2007
13 years 11 months ago
2007
This paper studies the group testing problem in graphs as follows. Given a graph G = (V, E), determine the minimum number t(G) such that t(G) tests are sufficient to identify an u...
JCO
2007
13 years 11 months ago
2007
