{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T01:40:58Z","timestamp":1787017258829,"version":"build-2736575974"},"reference-count":17,"publisher":"World Scientific Pub Co Pte Ltd","issue":"03n04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2016,9]]},"abstract":"<jats:p>\n                    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\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\" overflow=\"scroll\" altimg=\"eq-00001.gif\">\n                      <mml:mrow>\n                        <mml:mi>O<\/mml:mi>\n                        <mml:mo stretchy=\"false\">(<\/mml:mo>\n                        <mml:msup>\n                          <mml:mi>n<\/mml:mi>\n                          <mml:mn>5<\/mml:mn>\n                        <\/mml:msup>\n                        <mml:mo stretchy=\"false\">)<\/mml:mo>\n                      <\/mml:mrow>\n                    <\/mml:math>\n                    to\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\" overflow=\"scroll\" altimg=\"eq-00002.gif\">\n                      <mml:mrow>\n                        <mml:mi>O<\/mml:mi>\n                        <mml:mo stretchy=\"false\">(<\/mml:mo>\n                        <mml:msup>\n                          <mml:mi>n<\/mml:mi>\n                          <mml:mn>3<\/mml:mn>\n                        <\/mml:msup>\n                        <mml:mi>log<\/mml:mi>\n                        <mml:mi>n<\/mml:mi>\n                        <mml:mo stretchy=\"false\">)<\/mml:mo>\n                      <\/mml:mrow>\n                    <\/mml:math>\n                    , where n is the dimension of the input graph.\n                  <\/jats:p>","DOI":"10.1142\/s0219265916500067","type":"journal-article","created":{"date-parts":[[2017,1,23]],"date-time":"2017-01-23T03:34:57Z","timestamp":1485142497000},"page":"1650006","source":"Crossref","is-referenced-by-count":2,"title":["An Improved Algorithm for the Node-to-Set Disjoint Paths Problem on Bi-Rotator Graphs"],"prefix":"10.1142","volume":"16","author":[{"given":"YU-SHENG","family":"HUANG","sequence":"first","affiliation":[{"name":"Department of Computer Science and Information Engineering, National Dong Hwa University, Hualien 974, Taiwan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"SHENG-LUNG","family":"PENG","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Information Engineering, National Dong Hwa University, Hualien 974, Taiwan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"RO-YU","family":"WU","sequence":"additional","affiliation":[{"name":"Department of Industrial Management, Lunghwa University of Science and Technology, Taoyuan 333, Taiwan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"219","published-online":{"date-parts":[[2017,1,23]]},"reference":[{"key":"p_1","first-page":"565","author":"Akl S. G.","year":"1992","journal-title":"Conference on Algorithms and Hardware for Parallel Processing"},{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(93)90107-V"},{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230230403"},{"key":"p_4","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/3-540-63890-3_8","author":"Bai L.","year":"1997","journal-title":"International Symposium on Algorithms and Computation"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1109\/71.553290"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1109\/71.159045"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90043-9"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(97)00059-8"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.1996.507897"},{"key":"p_10","first-page":"668","author":"Hsu D. F.","year":"1994","journal-title":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E77-A(4) ("},{"key":"p_11","first-page":"2588","author":"Kaneko K.","year":"2003","journal-title":"IEICE Transaction on Information and Systems E86-D(12) ("},{"key":"p_12","doi-asserted-by":"publisher","DOI":"10.1093\/ietisy\/e89-d.2.647"},{"key":"p_13","first-page":"1155","author":"Kaneko K.","year":"2001","journal-title":"IEICE Transaction on Information and Systems E84-D(9) ("},{"key":"p_14","first-page":"1628","author":"Kaneko K.","year":"2003","journal-title":"IEICE Transaction on Information and Systems E86-D(9) ("},{"key":"p_15","first-page":"360","author":"Qiu K.","year":"1991","journal-title":"International Conference on Computing and Information"},{"key":"p_16","doi-asserted-by":"publisher","DOI":"10.1145\/62044.62050"},{"key":"p_17","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00064-4"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219265916500067","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T22:36:27Z","timestamp":1565130987000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219265916500067"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9]]},"references-count":17,"journal-issue":{"issue":"03n04","published-online":{"date-parts":[[2017,1,23]]},"published-print":{"date-parts":[[2016,9]]}},"alternative-id":["10.1142\/S0219265916500067"],"URL":"https:\/\/doi.org\/10.1142\/s0219265916500067","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"value":"0219-2659","type":"print"},{"value":"1793-6713","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9]]}}}