Recursive algorithm for routing analysis in unidirectional flow networks

Gao Yan; Laxmisha Rai; Jian Fen Xing

doi:10.1117/12.2014143

13 March 2013 Recursive algorithm for routing analysis in unidirectional flow networks

Gao Yan, Laxmisha Rai, Jian Fen Xing

Proceedings Volume 8784, Fifth International Conference on Machine Vision (ICMV 2012): Algorithms, Pattern Recognition, and Basic Technologies; 87841M (2013) https://doi.org/10.1117/12.2014143
Event: Fifth International Conference on Machine Vision (ICMV 12), 2012, Wuhan, China

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.

Citation Download Citation

Gao Yan, Laxmisha Rai, and Jian Fen Xing "Recursive algorithm for routing analysis in unidirectional flow networks", Proc. SPIE 8784, Fifth International Conference on Machine Vision (ICMV 2012): Algorithms, Pattern Recognition, and Basic Technologies, 87841M (13 March 2013); https://doi.org/10.1117/12.2014143

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available