DM
2002
13 years 11 months ago
2002
A
DM
2002
13 years 11 months ago
2002
Let G be a planar embedded 2-connected graph. Then the vertices of its resonance graph R(G) are the 1-factors of G, two 1-factors being adjacent whenever their symmetric differenc...
DM
2002
13 years 11 months ago
2002
DM
2002
13 years 11 months ago
2002
DM
2002
13 years 11 months ago
2002
This paper provides an overview of methods and systems developed for record linkage. Modern record linkage begins with the pioneering work of Newcombe and is especially based on t...
DM
2002
13 years 11 months ago
2002
Let ^G be a graph obtained from a graph G with no loops or coloops by replacing each edge e = uw of G by a connected graph He that has only the vertices u and w in common with the...
DM
2002
13 years 11 months ago
2002
Abstract. A lecture hall partition of length n is a sequence (1, 2, . . . , n) of nonnegative integers satisfying 0 1/1
DM
2002
13 years 11 months ago
2002
We disprove a conjecture of Bultena and Ruskey [1], that all trees which are cyclic graphs of cyclic Gray codes have diameter 2 or 4, by producing codes whose cyclic graphs are tre...
DM
2002
13 years 11 months ago
2002
DM
2002
13 years 11 months ago
2002
Abstract. A k-sized balanced sampling plan excluding contiguous units of order v and index , denoted by BSEC(v, k, ), is said to be bicyclic if it admits an automorphism consisting...