论文信息 - Periodic Partial Words and Random Bipartite Graphs

Periodic Partial Words and Random Bipartite Graphs

The interaction property or the Fine--Wilf property for periodic partial words is studied. Partial words with two periods are represented by bipartite graphs and the interaction property is related to the edge connectedness property of these graphs. Threshold functions for the edge connectedness of random bipartite graphs and multigraphs are found. As a corollary, the interaction property is described in probabilistic terms.

Arseny M. Shur | Lidia A. Idiatulina | A. M. Shur

[1] Francine Blanchet-Sadri,et al. Graph connectivity, partial words, and a theorem of Fine and Wilf , 2008, Inf. Comput..

[2] Tero Harju,et al. The theorem of Fine and Wilf for relational periods , 2009, RAIRO Theor. Informatics Appl..

[3] Arseny M. Shur,et al. On the Periods of Partial Words , 2001, MFCS.

[4] A. M. Shur,et al. Partial words and the interaction property of periods , 2004 .

[5] Jean Berstel,et al. Partial Words and a Theorem of Fine and Wilf , 1999, Theor. Comput. Sci..

[6] Béla Bollobás,et al. Random Graphs, Second Edition , 2001, Cambridge Studies in Advanced Mathematics.

[7] M. Fischer,et al. STRING-MATCHING AND OTHER PRODUCTS , 1974 .

[8] A. I. SALTYKOV,et al. The number of components in a random bipartite graph , 1995 .

[9] B. Bollobás. The evolution of random graphs , 1984 .

[10] H. Wilf,et al. Uniqueness theorems for periodic functions , 1965 .

[11] S. Muthukrishnan,et al. Non-standard stringology: algorithms and complexity , 1994, STOC '94.

[12] I. B. KALUGIN,et al. The number of components of a random bipartite graph , 1991 .