|
Avtomatika i Telemekhanika, 2015, Issue 10, Pages 106–112
(Mi at14294)
|
|
|
|
This article is cited in 7 scientific papers (total in 7 papers)
System Analysis and Operations Research
A DNA algorithm for the maximal matching problem
Li Wenxiaa, E. M. Patrikeeva, Xiao Dongmeib a East China Normal University, Shanghai, China
b Jiao Tong University, Shanghai, China
Abstract:
We propose a procedure for solving the classical discrete extremal maximal matching problem with the Adleman-Lipton model as the computational architecture. We show that for an undirected graph with $n$ edges the solution can be obtained in $O(n^2)$ steps.
Citation:
Li Wenxia, E. M. Patrikeev, Xiao Dongmei, “A DNA algorithm for the maximal matching problem”, Avtomat. i Telemekh., 2015, no. 10, 106–112; Autom. Remote Control, 76:10 (2015), 1797–1802
Linking options:
https://www.mathnet.ru/eng/at14294 https://www.mathnet.ru/eng/at/y2015/i10/p106
|
Statistics & downloads: |
Abstract page: | 143 | Full-text PDF : | 43 | References: | 26 | First page: | 12 |
|