scholarly journals Manipulation Strategies for the Rank-Maximal Matching Problem

2018 ◽  
pp. 316-327 ◽  
Author(s):  
Pratik Ghosal ◽  
Katarzyna Paluch
Keyword(s):  
Matching Problem ◽  
Maximal Matching

DNA Computing Algorithm to Solve the Least Maximal Matching Problem

2015 ◽  
Vol 12 (9) ◽  
pp. 2348-2351
Author(s):  
Lingmin Zhang ◽  
Dongmei Huang ◽  
Wang Wang ◽  
Ji Zuwen
Keyword(s):  
Dna Computing ◽  
Matching Problem ◽  
Maximal Matching ◽  
Computing Algorithm

A DNA Algorithm for the maximal matching problem

2015 ◽  
Vol 76 (10) ◽  
pp. 1797-1802 ◽  
Author(s):  
Wenxia Li ◽  
E. M. Patrikeev ◽  
Dongmei Xiao
Keyword(s):  
Matching Problem ◽  
Maximal Matching ◽  
Dna Algorithm

Decomposition algorithms for solving the minimum weight maximal matching problem

Networks ◽  
2013 ◽  
Vol 62 (4) ◽  
pp. 273-287 ◽  
Author(s):  
Merve Bodur ◽  
Tinaz Ekim ◽  
Z. Caner Taşkin
Keyword(s):  
Minimum Weight ◽  
Decomposition Algorithms ◽  
Matching Problem ◽  
Maximal Matching

scholarly journals Integer programming formulations for the minimum weighted maximal matching problem

2011 ◽  
Vol 6 (6) ◽  
pp. 1161-1171 ◽  
Author(s):  
Z. Caner Taşkın ◽  
Tınaz Ekim
Keyword(s):  
Integer Programming ◽  
Matching Problem ◽  
Maximal Matching

Solving the maximal matching problem with DNA molecules in Adleman–Lipton model

2016 ◽  
Vol 09 (02) ◽  
pp. 1650019 ◽  
Author(s):  
Zhaocai Wang ◽  
Zuwen Ji ◽  
Ziyi Su ◽  
Xiaoming Wang ◽  
Kai Zhao
Keyword(s):  
Undirected Graph ◽  
Applied Mathematics ◽  
Vertex Cover ◽  
Real Life ◽  
Matching Problem ◽  
Maximal Matching ◽  
Dna Strands ◽  
Path Search ◽  
Hard Problems ◽  
Np Complete

The maximal matching problem (MMP) is to find maximal edge subsets in a given undirected graph, that no pair of edges are adjacent in the subsets. It is a vitally important NP-complete problem in graph theory and applied mathematics, having numerous real life applications in optimal combination and linear programming fields. It can be difficultly solved by the electronic computer in exponential level time. Meanwhile in previous studies deoxyribonucleic acid (DNA) molecular operations usually were used to solve NP-complete continuous path search problems, e.g. HPP, traveling salesman problem, rarely for NP-hard problems with discrete vertices or edges solutions, such as the minimum vertex cover problem, graph coloring problem and so on. In this paper, we present a DNA algorithm for solving the MMP with DNA molecular operations. For an undirected graph with [Formula: see text] vertices and [Formula: see text] edges, we reasonably design fixed length DNA strands representing vertices and edges of the graph, take appropriate steps and get the solutions of the MMP in proper length range using [Formula: see text] time. We extend the application of DNA molecular operations and simultaneously simplify the complexity of the computation.

Sign in / Sign up

Export Citation Format

Share Document