Back to Search
Start Over
An Improved Algorithm for the Node-to-Set Disjoint Paths Problem on Bi-Rotator Graphs.
- Source :
-
Journal of Interconnection Networks . Sep-Dec2016, Vol. 16 Issue 3/4, p-1. 18p. - Publication Year :
- 2016
-
Abstract
- Given a source node and a node set, the node-to-set disjoint paths problem is to find disjoint paths from the source node to all nodes from the node set. In this paper, we propose an improved algorithm for the node-to-set disjoint paths problem on bi-rotator graphs. Our result improves the complexity of previous result from to , where n is the dimension of the input graph. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 02192659
- Volume :
- 16
- Issue :
- 3/4
- Database :
- Academic Search Index
- Journal :
- Journal of Interconnection Networks
- Publication Type :
- Academic Journal
- Accession number :
- 120841762
- Full Text :
- https://doi.org/10.1142/S0219265916500067