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...

Cijeli opis

Spremljeno u:
Bibliografski detalji
Glavni autori: Baumgardner, Jordan, Acker, Karen, Adefuye, Oyinade, Crowley, Samuel Thomas, DeLoache, Will, Dickson, James O, Heard, Lane, Martens, Andrew T, Morton, Nickolaus, Ritter, Michelle, Shoecraft, Amber, Treece, Jessica, Unzicker, Matthew, Valencia, Amanda, Waters, Mike, Campbell, A Malcolm, Heyer, Laurie J, Poet, Jeffrey L, Eckdahl, Todd T
Format: Artigo
Jezik:Inglês
Izdano: BioMed Central 2009
Teme:
Research
Online pristup: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
Oznake: Dodaj oznaku
Bez oznaka, Budi prvi tko označuje ovaj zapis!

Similar Items