A massively parallel algorithm based on DNA computations for constructing minimal spanning trees

DOI10.1080/09720529.2002.10697949zbMath1009.68191OpenAlexW2317152303MaRDI QIDQ4796064

No author found.

Publication date: 6 April 2003

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2002.10697949

zbMATH Keywords

DNA computationminimal spanning trees

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cites Work

• A parallel algorithm for constructing minimum spanning trees

This page was built for publication: A massively parallel algorithm based on DNA computations for constructing minimal spanning trees