{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T21:21:10Z","timestamp":1726089670818},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030539559"},{"type":"electronic","value":"9783030539566"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-53956-6_13","type":"book-chapter","created":{"date-parts":[[2020,7,12]],"date-time":"2020-07-12T07:02:42Z","timestamp":1594537362000},"page":"142-148","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Canine Algorithm for Node Disjoint Paths"],"prefix":"10.1007","author":[{"given":"R.","family":"Ananthalakshmi Ammal","sequence":"first","affiliation":[]},{"given":"P. C.","family":"Sajimon","sequence":"additional","affiliation":[]},{"given":"Vinod Chandra","family":"S S","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,13]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1002\/net.1975.5.1.45","volume":"5","author":"RM Karp","year":"1975","unstructured":"Karp, R.M.: On the computational complexity of combinatorial problems. Networks 5, 45\u201368 (1975)","journal-title":"Networks"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1061425.1061430","volume":"5","author":"JF Lynch","year":"1975","unstructured":"Lynch, J.F.: The equivalence of theorem proving and the interconnection problem. SIGDA Newsl. 5, 31\u201336 (1975)","journal-title":"SIGDA Newsl."},{"key":"13_CR3","doi-asserted-by":"publisher","unstructured":"Dijkstra, E.W.: A note on two problems in connection with graphs. Numer. Math. 1 (1959). https:\/\/doi.org\/10.1007\/BF01386390","DOI":"10.1007\/BF01386390"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"R Bellman","year":"1958","unstructured":"Bellman, R.: On a routing problem. Q. Appl. Math. 16, 87\u201390 (1958). https:\/\/doi.org\/10.1090\/qam\/102435","journal-title":"Q. Appl. Math."},{"key":"13_CR5","doi-asserted-by":"publisher","DOI":"10.1515\/9781400875184","volume-title":"Flows in Networks","author":"L Ford","year":"1962","unstructured":"Ford, L., Fulkerson, D.R.: Flows in Networks. Princeton Princeton University Press, Princeton (1962)"},{"key":"13_CR6","doi-asserted-by":"publisher","unstructured":"Ducatelle, F., Di Caro, G.A., Gambardella, L.M.: Principles and applications of swarm intelligence for adaptive routing in telecommunications networks. Swarm Intell. 4 (2010). https:\/\/doi.org\/10.1007\/s11721-010-0040-x","DOI":"10.1007\/s11721-010-0040-x"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s40031-014-0182-0","volume":"97","author":"SS VinodChandra","year":"2016","unstructured":"VinodChandra, S.S.: Smell detection agent based optimization algorithm. J. Inst. Eng. India Ser. B. 97, 431\u2013436 (2016)","journal-title":"J. Inst. Eng. India Ser. B."},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-319-61833-3_53","volume-title":"Advances in Swarm Intelligence","author":"R Ananthalakshmi Ammal","year":"2017","unstructured":"Ananthalakshmi Ammal, R., Sajimon, P.C., Vinodchandra, S.S.: Application of smell detection agent based algorithm for optimal path identification by sdn controllers. In: Tan, Y., Takagi, H., Shi, Y., Niu, B. (eds.) ICSI 2017. LNCS, vol. 10386, pp. 502\u2013510. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61833-3_53"},{"key":"13_CR9","doi-asserted-by":"publisher","unstructured":"Suurballe, J.W.: Disjoint paths in a network. Networks 4 (1974). https:\/\/doi.org\/10.1002\/net.3230040204","DOI":"10.1002\/net.3230040204"},{"key":"13_CR10","doi-asserted-by":"publisher","unstructured":"Bhandari, R.: Optimal physical diversity algorithms and survivable networks. In: IEEE Symposium on Computers and Communications \u2013 Proceedings, pp. 433\u2013441. IEEE (1997). https:\/\/doi.org\/10.1109\/iscc.1997.616037","DOI":"10.1109\/iscc.1997.616037"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Yang, S., Trajanovski, S., Kuipers, F.A.: Availability based path selection. In: Proceedings of International Workshop on Reliable Networks Design and Modeling (RNDM) (2014)","DOI":"10.1109\/RNDM.2014.7014929"},{"issue":"4","key":"13_CR12","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1007\/s10878-012-9462-2","volume":"26","author":"MT Omran","year":"2012","unstructured":"Omran, M.T., Sack, J.-R., Zarrabi-Zadeh, H.: Finding paths with minimum shared edges. J. Comb. Optim. 26(4), 709\u2013722 (2012). https:\/\/doi.org\/10.1007\/s10878-012-9462-2","journal-title":"J. Comb. Optim."},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1109\/TNET.2014.2309253","volume":"23","author":"S Trajanovski","year":"2015","unstructured":"Trajanovski, S., Kuipers, F.A., Ilic, A., Crowcroft, J., Van Mieghem, P.: Finding critical regions and region-disjoint paths in a network. IEEE\/ACM Trans. Netw. 23, 908\u2013921 (2015). https:\/\/doi.org\/10.1109\/TNET.2014.2309253","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"96","DOI":"10.4064\/fm-10-1-96-115","volume":"10","author":"K Menger","year":"1927","unstructured":"Menger, K.: Zur allgemeinen Kurventheorie. Fundam. Math. 10, 96\u2013115 (1927)","journal-title":"Fundam. Math."},{"key":"13_CR15","unstructured":"Broder, A.Z., Frieze, A.M., Suen, S., Upfal, E.: An efficient algorithm for the vertex-disjoint paths problem in random graphs. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 261\u2013268 (1996)"}],"container-title":["Lecture Notes in Computer Science","Advances in Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-53956-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,28]],"date-time":"2020-12-28T03:33:28Z","timestamp":1609126408000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-53956-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030539559","9783030539566"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-53956-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"13 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICSI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Swarm Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgrade","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Serbia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"swarm2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ic-si.org\/committees\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Confy","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"127","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"63","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}