PATH IDENTIFICATION PROCEDURE FOR NETWORKS.
Publication
, Journal Article
Garg, DP
Published in: American Society of Mechanical Engineers (Paper)
1973
A generalized procedure has been advanced for path identification in complex multiloop interconnect directed networks. Reference to transportation networks has been made for the sake of specificity in this paper although the proposed method is equally applicable to all types of directed networks. Typically, one may utilize such procedures for developing information aimed at an efficient traffic rerouting between a given origin-destination pair. The rerouting may be necessitated by situations such as vehicular congestion or adverse weather conditions along a previously assigned nodal segment. A network example illustrates the application of proposed algorithm.
Duke Scholars
Published In
American Society of Mechanical Engineers (Paper)
Publication Date
1973
Issue
73-WA/Aut-8
Start / End Page
4
Citation
APA
Chicago
ICMJE
MLA
NLM
Garg, D. P. (1973). PATH IDENTIFICATION PROCEDURE FOR NETWORKS. American Society of Mechanical Engineers (Paper), (73-WA/Aut-8), 4.
Garg, D. P. “PATH IDENTIFICATION PROCEDURE FOR NETWORKS.” American Society of Mechanical Engineers (Paper), no. 73-WA/Aut-8 (1973): 4.
Garg DP. PATH IDENTIFICATION PROCEDURE FOR NETWORKS. American Society of Mechanical Engineers (Paper). 1973;(73-WA/Aut-8):4.
Garg, D. P. “PATH IDENTIFICATION PROCEDURE FOR NETWORKS.” American Society of Mechanical Engineers (Paper), no. 73-WA/Aut-8, 1973, p. 4.
Garg DP. PATH IDENTIFICATION PROCEDURE FOR NETWORKS. American Society of Mechanical Engineers (Paper). 1973;(73-WA/Aut-8):4.
Published In
American Society of Mechanical Engineers (Paper)
Publication Date
1973
Issue
73-WA/Aut-8
Start / End Page
4