Authors: Florentin Smarandache, Sukanto Bhattacharya
We have posed a simple but interesting graph theoretic problem and posited a heuristic solution procedure, which we have christened as Vectored Route-length Minimization Search (VeRMinS).
Comments: 7 Pages.
Download: PDF
[v1] 2014-04-17 02:47:12
Unique-IP document downloads: 1 times
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.