Open AccessThe Method of Plurality Generation of Disjoint Paths Using Horizontal Exclusive Scheduling
Author(s) -
Y. O. Kulakov,
Alex Kogan
Publication year - 2014
Publication title -
the advanced science journal
Language(s) - English
Resource type - Journals
eISSN - 2219-7478
pISSN - 2219-746X
DOI - 10.15550/asj.2014.09.016
Subject(s) - disjoint sets , computer science , scheduling (production processes) , parallel computing , mathematics , combinatorics , mathematical optimization
. The use of the method based on the multipath routing organization for secure routing in mobile networks is quite efficient. In this paper, the method of plurality generation of safest ways is proved, which allows reducing the time complexity of the plurality of the safest ways formation algorithm due to the operations on the set of vertices and their neighborhood.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom