Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: 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. ,  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 O(n5) to O(n3logn), where n is the dimension of the input graph.
['Yu-Sheng Huang', 'Sheng-Lung Peng', 'Ro-Yu Wu']
I am writing a research paper on a idea An Improved Algorithm for the Node-to-Set Disjoint Paths Problem on Bi-Rotator Graphs
[{"from": "human", "value": "I am writing a research paper on a idea An Improved Algorithm for the Node-to-Set Disjoint Paths Problem on Bi-Rotator Graphs"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: 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. ,  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 O(n5) to O(n3logn), where n is the dimension of the input graph."}]