Loading...
Solving a Hamiltonian Path Problem with a bacterial computer
BACKGROUND: The Hamiltonian Path Problem asks whether there is a route in a directed graph from a beginning node to an ending node, visiting each node exactly once. The Hamiltonian Path Problem is NP complete, achieving surprising computational complexity with modest increases in size. This challeng...
Na minha lista:
Main Authors: | , , , , , , , , , , , , , , , , , , |
---|---|
Format: | Artigo |
Sprog: | Inglês |
Udgivet: |
BioMed Central
2009
|
Fag: | |
Online adgang: | https://ncbi.nlm.nih.gov/pmc/articles/PMC2723075/ https://ncbi.nlm.nih.gov/pubmed/19630940 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1186/1754-1611-3-11 |
Tags: |
Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!
|