A new algorithm for finding vertex-disjoint paths
Joint Authors
Kurt, Mehmet
Berberler, Murat
Ugurlu, Onur
Source
The International Arab Journal of Information Technology
Issue
Vol. 12, Issue 6 (31 Dec. 2015)7 p.
Publisher
Publication Date
2015-12-31
Country of Publication
Jordan
No. of Pages
7
Main Subjects
Topics
Abstract EN
The fact that the demands which could be labelled as “luxurious” in the past times, have became requirements makes it inevitable that the service providers do new researches and prepare alternative plans under harsh competition conditions.
In order to provide the customers with the services in terms of the committed standards by taking the possible damages on wired and wireless networks into consideration.
Finding vertex disjoint paths gives many advantages on the wired or wireless communication especially on Ad-Hoc Networks.
In this paper, we suggest a new algorithm that calculates alternative routes which do not contain common vertex (vertex-disjoint path) with problematic route during a point-to-point communication on the network in a short time and it is compared to similar algorithms.
American Psychological Association (APA)
Kurt, Mehmet& Berberler, Murat& Ugurlu, Onur. 2015. A new algorithm for finding vertex-disjoint paths. The International Arab Journal of Information Technology،Vol. 12, no. 6.
https://search.emarefa.net/detail/BIM-431289
Modern Language Association (MLA)
Kurt, Mehmet…[et al.]. A new algorithm for finding vertex-disjoint paths. The International Arab Journal of Information Technology Vol. 12, no. 6 (2015).
https://search.emarefa.net/detail/BIM-431289
American Medical Association (AMA)
Kurt, Mehmet& Berberler, Murat& Ugurlu, Onur. A new algorithm for finding vertex-disjoint paths. The International Arab Journal of Information Technology. 2015. Vol. 12, no. 6.
https://search.emarefa.net/detail/BIM-431289
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-431289