DNA computing of bipartite graphs for maximum matching

DOI10.1023/A:1020808521487zbMath1019.92013OpenAlexW1534668320MaRDI QIDQ1850917

Shi-ying Wang

Publication date: 15 December 2002

Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1020808521487

zbMATH Keywords

maximum matchingDNA computingmaximal matchingaugmenting path

Mathematics Subject Classification ID

Applications of graph theory (05C90) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Biochemistry, molecular biology (92C40)

Related Items (2)

DNA labelled graphs with DNA computing ⋮ DNA solution of integer linear programming

This page was built for publication: DNA computing of bipartite graphs for maximum matching