SIAMDM 1998 | Sciweavers

24

SIAMDM
1998

86views more SIAMDM 1998»

Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes

13 years 9 months ago

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

claim paper

Read More »

22

click to vote

SIAMDM
1998

64views more SIAMDM 1998»

The Ring Loading Problem

13 years 9 months ago

Download www.cs.ust.hk

Alexander Schrijver, Paul D. Seymour, Peter Winkle...

claim paper

Read More »

36

click to vote

SIAMDM
1998

89views more SIAMDM 1998»

String Noninclusion Optimization Problems

13 years 9 months ago

Download www.computing.edu.au

For every string inclusion relation there are two optimization problems: ﬁnd a longest string included in every string of a given ﬁnite language, and ﬁnd a shortest string in...

Anatoly R. Rubinov, Vadim G. Timkovsky

claim paper

Read More »

23

click to vote

SIAMDM
1998

65views more SIAMDM 1998»

A Greedy Algorithm Estimating the Height of Random Trees

13 years 9 months ago

Download www.ima.umn.edu

Tomasz Luczak

claim paper

Read More »

20

click to vote

SIAMDM
1998

55views more SIAMDM 1998»

Multiple Capacity Vehicle Routing on Paths

13 years 9 months ago

Download www.math.nsysu.edu.tw

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 ﬁnding a shortest...

D. J. Guan, Xuding Zhu

claim paper

Read More »

25

click to vote

SIAMDM
1998

95views more SIAMDM 1998»

The Graphs with All Subgraphs T-Perfect

13 years 9 months ago

Download homepages.cwi.nl

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

claim paper

Read More »

18

click to vote

SIAMDM
1998

53views more SIAMDM 1998»

Two Arc-Disjoint Paths in Eulerian Digraphs

13 years 9 months ago

Download www.cs.elte.hu

András Frank, Toshihide Ibaraki, Hiroshi Na...

claim paper

Read More »

22

click to vote

SIAMDM
1998

165views more SIAMDM 1998»

The Number of Independent Sets in a Grid Graph

13 years 9 months ago

Download www.ces.clemson.edu

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 reﬁning earlier res...

Neil J. Calkin, Herbert S. Wilf

claim paper

Read More »

26

click to vote

SIAMDM
1998

102views more SIAMDM 1998»

A New Decoding Algorithm for Complete Decoding of Linear Block Codes

13 years 9 months ago

Download web.ntpu.edu.tw

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 ﬁnding a small...

Yunghsiang S. Han

claim paper

Read More »

20

click to vote

SIAMDM
1998

87views more SIAMDM 1998»

Sorting by Transpositions

13 years 9 months ago