Share Email Print
cover

Proceedings Paper

Recursive algorithm for routing analysis in unidirectional flow networks
Author(s): Gao Yan; Laxmisha Rai; Jian Fen Xing
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

This paper proposes a novel recursive algorithm, towards finding all routing paths in an unidirectional flow- network. The algorithm is recursive, so it provides a flexible approach comparing to iterative methods. Initially, all the paths from source to destinations are identified and represented in a two-dimensional matrix. The recursive algorithm uses the concept of blanking patterns, by identifying definite patterns of combinations of rows and columns in the two-dimensional matrix.

Paper Details

Date Published: 13 March 2013
PDF: 5 pages
Proc. SPIE 8784, Fifth International Conference on Machine Vision (ICMV 2012): Algorithms, Pattern Recognition, and Basic Technologies, 87841M (13 March 2013); doi: 10.1117/12.2014143
Show Author Affiliations
Gao Yan, Xuchang Univ. (China)
Laxmisha Rai, Shandong Univ. of Science and Technology (China)
Jian Fen Xing, China-Korea Joint Ocean Research Ctr. (China)


Published in SPIE Proceedings Vol. 8784:
Fifth International Conference on Machine Vision (ICMV 2012): Algorithms, Pattern Recognition, and Basic Technologies
Yulin Wang; Liansheng Tan; Jianhong Zhou, Editor(s)

© SPIE. Terms of Use
Back to Top