Sciweavers

JCO
2007
56views more  JCO 2007»
13 years 5 months ago
An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure
This paper discusses the relation among four problems: graph testing, DNA complex screening, superimposed codes and secure key distribution. We prove a surprising equivalence relat...
H. B. Chen, Ding-Zhu Du, Frank K. Hwang
JCO
2007
149views more  JCO 2007»
13 years 5 months ago
A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem
The 2-interval pattern problem over its various models and restrictions was proposed by Vialette (2004) for the application of RNA secondary structure prediction. We present an O(n...
Minghui Jiang
JCO
2007
97views more  JCO 2007»
13 years 5 months ago
Restricted domination parameters in graphs
In a graph G, a vertex dominates itself and its neighbors. A subset S ⊆ V (G) is an m-tuple dominating set if S dominates every vertex of G at least m times, and an m-dominating...
Wayne Goddard, Michael A. Henning
JCO
2007
130views more  JCO 2007»
13 years 5 months ago
On edge orienting methods for graph coloring
We consider the problem of orienting the edges of a graph so that the length of a longest path in the resulting digraph is minimum. As shown by Gallai, Roy and Vitaver, this edge ...
Bernard Gendron, Alain Hertz, Patrick St-Louis
JCO
2007
46views more  JCO 2007»
13 years 5 months ago
On Ring Grooming in optical networks
Gruia Calinescu, Peng-Jun Wan
JCO
2007
123views more  JCO 2007»
13 years 5 months ago
On the number of local minima for the multidimensional assignment problem
The Multidimensional Assignment Problem (MAP) is an NP-hard combinatorial optimization problem occurring in many applications, such as data association, target tracking, and resou...
Don A. Grundel, Pavlo A. Krokhmal, Carlos A. S. Ol...
JCO
2007
74views more  JCO 2007»
13 years 5 months ago
Maximum cyclic 4-cycle packings of the complete multipartite graph
A graph G is said to be m-sufficient if m is not exceeding the order of G, each vertex of G is of even degree, and the number of edges in G is a multiple of m. A complete multipar...
Shung-Liang Wu, Hung-Lin Fu