10 search results - page 2 / 2 » siamdm 1998 |
SIAMDM
1998
13 years 10 months ago
1998
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...
SIAMDM
1998
13 years 10 months ago
1998
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...
SIAMDM
1998
13 years 10 months ago
1998
In this paper, we investigate combinatorialproperties and constructions of two recent topics of cryptographic interest, namely frameproof codes for digital ngerprinting, and trace...
SIAMDM
1998
13 years 10 months ago
1998
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...
SIAMDM
1998
13 years 10 months ago
1998
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...