Sciweavers

JCO
2007
80views more  JCO 2007»
13 years 5 months ago
The wireless network jamming problem
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 ...
Clayton W. Commander, Panos M. Pardalos, Valeriy R...
JCO
2007
82views more  JCO 2007»
13 years 5 months ago
The densest k-subgraph problem on clique graphs
Maria Liazi, Ioannis Milis, Fanny Pascual, Vassili...
JCO
2007
128views more  JCO 2007»
13 years 5 months ago
Approximation algorithms and hardness results for labeled connectivity problems
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-...
Refael Hassin, Jérôme Monnot, Danny S...
JCO
2007
76views more  JCO 2007»
13 years 5 months ago
Wide diameters of de Bruijn graphs
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...
Jyhmin Kuo, Hung-Lin Fu
JCO
2007
113views more  JCO 2007»
13 years 5 months ago
Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
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...
Jerrold R. Griggs, Xiaohua Teresa Jin
JCO
2007
122views more  JCO 2007»
13 years 5 months ago
Packing 5-cycles into balanced complete m -partite graphs for odd m
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...
Ming-Hway Huang, Chin-Mei Fu, Hung-Lin Fu
JCO
2007
100views more  JCO 2007»
13 years 5 months ago
Semi-online scheduling with "end of sequence" information
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 ...
Leah Epstein, Deshi Ye
JCO
2007
65views more  JCO 2007»
13 years 5 months ago
Group testing in graphs
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...
Justie Su-tzu Juan, Gerard J. Chang
JCO
2007
90views more  JCO 2007»
13 years 5 months ago
An algorithm for optimal difference systems of sets
Vladimir D. Tonchev, Hao Wang