Login / Signup

A Study on Lower Bound of Direct Proportional Length-Based DNA Computing for Shortest Path Problem.

Zuwairie IbrahimYusei TsuboiOsamu OnoMarzuki Khalid
Published in: CIS (2004)
Keyphrases
  • lower bound
  • shortest path problem
  • dna computing
  • upper bound
  • data collection
  • shortest path
  • interval data
  • optimal solution
  • random walk
  • branch and bound
  • branch and bound algorithm
  • single source