๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Reconstructing Reconstruction: A Problem for Educational Historians

โœ Scribed by Review by: Wayne J. Urban

Book ID
124622501
Publisher
John Wiley and Sons
Year
1975
Tongue
English
Weight
296 KB
Volume
15
Category
Article
ISSN
0018-2680

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On a Reconstruction Problem for Sequence
On a Reconstruction Problem for Sequences
โœ I. Krasikov; Y. Roditty ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 439 KB

It is shown that any word of length n is uniquely determined by all its ( n k ) subwords of length k, provided k w 16 7 -nx+5. This improves the bound k wnร‚2x given in B. Manvel et al. (Discrete Math. 94 (1991), 209 219). 1997 Academic Press ## 1. Introduction Given a word X of length n with term

On a reconstruction problem
On a reconstruction problem
โœ Bhalchandra D. Thatte ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 86 KB

This note supplements an earlier paper of this author, in which the concept of a strong k-hypomorphism between two graphs was defined (Thatte, 1990, Section VI). For k = 1, this is just a hypomorphism. Here it is proved that strongly k-hypomorphic graphs and strongly k-edge hypomorphic directed grap