Sciweavers

Share
SIAMDM
1998
86views more  SIAMDM 1998»
8 years 4 months ago
Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
In this paper, we investigate combinatorialproperties and constructions of two recent topics of cryptographic interest, namely frameproof codes for digital ngerprinting, and trace...
Douglas R. Stinson, Ruizhong Wei
SIAMDM
1998
64views more  SIAMDM 1998»
8 years 4 months ago
The Ring Loading Problem
Alexander Schrijver, Paul D. Seymour, Peter Winkle...
SIAMDM
1998
89views more  SIAMDM 1998»
8 years 4 months ago
String Noninclusion Optimization Problems
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...
Anatoly R. Rubinov, Vadim G. Timkovsky
SIAMDM
1998
55views more  SIAMDM 1998»
8 years 4 months ago
Multiple Capacity Vehicle Routing on Paths
Consider the problem of transporting a set of objects between the vertices of a simple graph by a vehicle that traverses the edges of the graph. The problem of finding a shortest...
D. J. Guan, Xuding Zhu
SIAMDM
1998
95views more  SIAMDM 1998»
8 years 4 months ago
The Graphs with All Subgraphs T-Perfect
The richest class of t-perfect graphs known so far consists of the graphs with no so-called odd-K4. Clearly, these graphs have the special property that they are hereditary t-perfe...
A. M. H. Gerards, F. Bruce Shepherd
SIAMDM
1998
53views more  SIAMDM 1998»
8 years 4 months ago
Two Arc-Disjoint Paths in Eulerian Digraphs
András Frank, Toshihide Ibaraki, Hiroshi Na...
SIAMDM
1998
165views more  SIAMDM 1998»
8 years 4 months ago
The Number of Independent Sets in a Grid Graph
If f(m, n) is the (vertex) independence number of the m × n grid graph, then we show that the double limit η = def limm,n→∞ f(m, n) 1 mn exists, thereby refining earlier res...
Neil J. Calkin, Herbert S. Wilf
SIAMDM
1998
102views more  SIAMDM 1998»
8 years 4 months ago
A New Decoding Algorithm for Complete Decoding of Linear Block Codes
In this paper we present and describe an improved version of the Zero-Neighbors algorithm, which we call the Zero-Coverings algorithm. We also present a method for finding a small...
Yunghsiang S. Han
SIAMDM
1998
87views more  SIAMDM 1998»
8 years 4 months ago
Sorting by Transpositions
Vineet Bafna, Pavel A. Pevzner
books