An Observation about Circular Shortest Paths: Dealing with Additional Constraints Using Branch and Bound
暂无分享,去创建一个
[1] Kurt Mehlhorn,et al. LEDA: a platform for combinatorial and geometric computing , 1997, CACM.
[2] Michael Buckley,et al. Regularised shortest-path extraction , 1997, Pattern Recognit. Lett..
[3] Changming Sun,et al. Circular shortest path in images , 2003, Pattern Recognit..
[4] Mathews Jacob,et al. Neurite tracing in fluorescence microscopy images using ridge filtering and graph searching: principles and validation , 2004, 2004 2nd IEEE International Symposium on Biomedical Imaging: Nano to Macro (IEEE Cat No. 04EX821).
[5] Changming Sun,et al. Circular shortest paths by branch and bound , 2003, Pattern Recognit..
[6] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[7] Nikos Paragios,et al. Fast Dichotomic Multiple Search Algorithm for Shortest Cirular Path , 2006, 18th International Conference on Pattern Recognition (ICPR'06).