{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T12:16:44Z","timestamp":1778242604682,"version":"3.51.4"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030681531","type":"print"},{"value":"9783030681548","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-68154-8_38","type":"book-chapter","created":{"date-parts":[[2021,2,9]],"date-time":"2021-02-09T04:47:45Z","timestamp":1612846065000},"page":"418-429","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A New Topological Sorting Algorithm with Reduced Time Complexity"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4980-9858","authenticated-orcid":false,"given":"Tanzin","family":"Ahammad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1972-3239","authenticated-orcid":false,"given":"Mohammad","family":"Hasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7159-0990","authenticated-orcid":false,"given":"Md.","family":"Zahid Hassan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,8]]},"reference":[{"key":"38_CR1","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.ipl.2003.07.005","volume":"88","author":"J Zhou","year":"2003","unstructured":"Zhou, J., M\u00fcller, M.: Depth-first discovery algorithm for incremental topological sorting of directed acyclic graphs. Inf. Process. Lett. 88, 195\u2013200 (2003)","journal-title":"Inf. Process. Lett."},{"key":"38_CR2","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0196-6774(83)90042-1","volume":"4","author":"AD Kalvin","year":"1983","unstructured":"Kalvin, A.D., Varol, Y.L.: On the generation of all topological sorting. J. Algorithm 4, 150\u2013162 (1983)","journal-title":"J. Algorithm"},{"key":"38_CR3","doi-asserted-by":"crossref","unstructured":"Liu, R.: A low complexity topological sorting algorithm for directed acyclic graph. Int. J. Mach. Learn. Comput. 4(2) (2014)","DOI":"10.7763\/IJMLC.2014.V4.411"},{"key":"38_CR4","first-page":"451","volume":"12034","author":"A Barman","year":"2020","unstructured":"Barman, A., Namtirtha, A., Dutta, A., Dutta, B.: Food safety network for detecting adulteration in unsealed food products using topologcal ordering. Intell. Inf. Database Syst. 12034, 451\u2013463 (2020)","journal-title":"Intell. Inf. Database Syst."},{"issue":"1","key":"38_CR5","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1109\/TPWRS.2019.2936099","volume":"35","author":"A Beiranvand","year":"2019","unstructured":"Beiranvand, A., Cuffe, P.: A topological sorting approach to identify coherent cut-sets within power grids. IEEE Trans. Power Syst. 35(1), 721\u2013730 (2019)","journal-title":"IEEE Trans. Power Syst."},{"key":"38_CR6","doi-asserted-by":"crossref","unstructured":"Ajwani, D., Lozano, A.C., Zeh, N.: A topological sorting algorithm for large graphs. ACM J. Exp. Algorithmic 17(3) (2012)","DOI":"10.1145\/2133803.2330083"},{"key":"38_CR7","doi-asserted-by":"crossref","unstructured":"Pearce, D.J., Kelly, P.H.J.: A dynamic topological sort algorithm for directed acyclic graphs. ACM J. Exp. Algorithmic 11(1.7) (2006)","DOI":"10.1145\/1187436.1210590"},{"issue":"1","key":"38_CR8","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.jda.2005.01.008","volume":"4","author":"P Woelfel","year":"2006","unstructured":"Woelfel, P.: Symbolic topological sorting with OBDDs. J. Discrete Algorithms 4(1), 51\u201371 (2006)","journal-title":"J. Discrete Algorithms"},{"key":"38_CR9","doi-asserted-by":"crossref","unstructured":"Arge, L., Toma, L., Zeh, N.: I\/O-efficient topological sorting of planar DAGs. In: Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 85\u201393 (2003)","DOI":"10.1145\/777412.777427"},{"issue":"6","key":"38_CR10","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0020-0190(74)90001-5","volume":"2","author":"DE Knuth","year":"1974","unstructured":"Knuth, D.E., Szwarcfiter, J.L.: A structured program to generate all topological sorting arrangements. Inf. Process. Lett. 2(6), 153\u2013157 (1974)","journal-title":"Inf. Process. Lett."},{"key":"38_CR11","doi-asserted-by":"crossref","unstructured":"Er, M.C.: A parallel computation approach to topological sorting. Comput. J. 26(4) (1983)","DOI":"10.1093\/comjnl\/26.4.293"},{"key":"38_CR12","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/368996.369025","volume":"5","author":"AB Kahn","year":"1962","unstructured":"Kahn, A.B.: Topological sorting of large networks. Commun. ACM 5, 558\u2013562 (1962)","journal-title":"Commun. ACM"},{"key":"38_CR13","doi-asserted-by":"publisher","unstructured":"Ahammad, T., Hasan, M., Hasan, M., Sabir Hossain, M., Hoque, A., Rashid, M.M.: A new approach to solve job sequencing problem using dynamic programming with reduced time complexity. In: Chaubey, N., Parikh, S., Amin, K. (eds.) Computing Science, Communication and Security. COMS2 2020. Communications in Computer and Information Science, 1235. Springer, Singapore (2020). https:\/\/doi.org\/10.1007\/978-981-15-6648-6_25","DOI":"10.1007\/978-981-15-6648-6_25"},{"issue":"5","key":"38_CR14","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1109\/43.127622","volume":"11","author":"JF Beetem","year":"1992","unstructured":"Beetem, J.F.: Hierarchical topological sorting of apparent loops via partitioning. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 11(5), 607\u2013619 (1992)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"38_CR15","unstructured":"Intelligent Computing & Optimization, Conference proceedings ICO 2018, Springer, Cham, ISBN 978-3-030-00978-6"},{"key":"38_CR16","unstructured":"Intelligent Computing and Optimization, Proceedings of the 2nd International Conference on Intelligent Computing and Optimization 2019 (ICO 2019), Springer International Publishing, ISBN 978-3-030-33585-4"}],"container-title":["Advances in Intelligent Systems and Computing","Intelligent Computing and Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-68154-8_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,14]],"date-time":"2021-05-14T17:16:08Z","timestamp":1621012568000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-68154-8_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030681531","9783030681548"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-68154-8_38","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"value":"2194-5357","type":"print"},{"value":"2194-5365","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"8 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing & Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Koh Samui","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thailand","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":"17 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ico0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}