{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:32:57Z","timestamp":1750307577777,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,12,16]],"date-time":"2009-12-16T00:00:00Z","timestamp":1260921600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,12,16]]},"DOI":"10.1145\/1838002.1838079","type":"proceedings-article","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T13:15:36Z","timestamp":1280754936000},"page":"1-4","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["An edge-wise linear shortest path algorithm for non negative weighted undirected graphs"],"prefix":"10.1145","author":[{"given":"M. Aasim","family":"Qureshi","sequence":"first","affiliation":[{"name":"Universiti. Technologi, Petronas, Malaysia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohd Fadzil","family":"Hassan","sequence":"additional","affiliation":[{"name":"Universiti. Technologi, Petronas, Malaysia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sohail","family":"Safdar","sequence":"additional","affiliation":[{"name":"Universiti. Technologi, Petronas, Malaysia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rehan","family":"Akbar","sequence":"additional","affiliation":[{"name":"Universiti. Technologi, Petronas, Malaysia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rabia","family":"Sammi","sequence":"additional","affiliation":[{"name":"UIIT, PMAS Arid Agriculture University, Rawalpindi, Pakistan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,12,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/77600.77615"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00172-8"},{"key":"e_1_3_2_1_3_1","volume-title":"LLC 2006","author":"Binwu Zhang","year":"2006","unstructured":"Binwu Zhang , Jianzhong Zhang, Liqun Qi : 2006, The shortest path improvement problems under Hamming distance. In Springer Science+Business Media , LLC 2006 , (Published online: 20 September 2006 ) Binwu Zhang, Jianzhong Zhang, Liqun Qi: 2006, The shortest path improvement problems under Hamming distance. In Springer Science+Business Media, LLC 2006, (Published online: 20 September 2006)"},{"key":"e_1_3_2_1_4_1","first-page":"83","volume-title":"Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM","author":"Cherkassky B. V.","year":"1997","unstructured":"Cherkassky , B. V. , Goldberg , A. V. , and Silverstein , C . 1997 Buckets, heaps, lists, and monotone priority queues . In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM , New York , pp. 83 -- 92 . ( 1997 ) Cherkassky, B. V., Goldberg, A. V., and Silverstein, C. 1997 Buckets, heaps, lists, and monotone priority queues. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, pp. 83--92. (1997)"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80064-9"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(93)90040-4"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1186810.1186815"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/316542.316548"},{"key":"e_1_3_2_1_11_1","unstructured":"Muhammad Aasim Qureshi Onaiza Maqbool 2007 Complexity of Teaching: Computability and Complexity In 'International Conference on Teaching and Learning 2007' organized by INTI International University College at Putrajaya Malaysia.  Muhammad Aasim Qureshi Onaiza Maqbool 2007 Complexity of Teaching: Computability and Complexity In 'International Conference on Teaching and Learning 2007' organized by INTI International University College at Putrajaya Malaysia."},{"key":"e_1_3_2_1_12_1","unstructured":"Muhammad Aasim Qureshi Onaiza Maqbool 2007 Complexity of Teaching: Computability and Complexity INTI Journal Special Issue on Teaching and Learnning 2007  Muhammad Aasim Qureshi Onaiza Maqbool 2007 Complexity of Teaching: Computability and Complexity INTI Journal Special Issue on Teaching and Learnning 2007"},{"key":"e_1_3_2_1_13_1","volume-title":"Sohail Safdar, Rehan Akbar","author":"Muhammad Aasim Qureshi","year":"2009","unstructured":"Muhammad Aasim Qureshi , Mohd Fadzil Hassan , Sohail Safdar, Rehan Akbar ; 2009 , Raison D'\u00catre of Students' Plimmet in Comprehending Theoretical Computer Science (TCS) Courses, International Journal on Computer Science and Information Security Volume 6 (No 1) October 2009. Muhammad Aasim Qureshi, Mohd Fadzil Hassan, Sohail Safdar, Rehan Akbar; 2009, Raison D'\u00catre of Students' Plimmet in Comprehending Theoretical Computer Science (TCS) Courses, International Journal on Computer Science and Information Security Volume 6 (No 1) October 2009."},{"key":"e_1_3_2_1_14_1","volume-title":"Sohail Safdar, Rehan Akbar","author":"Muhammad Aasim Qureshi","year":"2009","unstructured":"Muhammad Aasim Qureshi , Mohd Fadzil Hassan , Sohail Safdar, Rehan Akbar ; 2009 , A O(|E|) time Shortest Path Algorithm for Non-Negative Weithted Undirected Graphs, International Journal on Computer Science and Information Security Volume 6 (No 1) October 2009. Muhammad Aasim Qureshi, Mohd Fadzil Hassan, Sohail Safdar, Rehan Akbar; 2009, A O(|E|) time Shortest Path Algorithm for Non-Negative Weithted Undirected Graphs, International Journal on Computer Science and Information Security Volume 6 (No 1) October 2009."},{"key":"e_1_3_2_1_15_1","series-title":"Lecture Notes on Computer Science","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/3-540-61680-2_51","volume-title":"Proceedings of the4th Annual European Symposium on Algorithms","author":"Raman R.","year":"1996","unstructured":"Raman , R. 1996 Priority queues: small monotone, and trans-dichotomous . In Proceedings of the4th Annual European Symposium on Algorithms . Lecture Notes on Computer Science , vol. 1136 , Springer-Verlag , New York , pp. 121 -- 137 . ( 1996 ) Raman, R. 1996 Priority queues: small monotone, and trans-dichotomous. In Proceedings of the4th Annual European Symposium on Algorithms. Lecture Notes on Computer Science, vol. 1136, Springer-Verlag, New York, pp. 121--137. (1996)"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/261342.261352"},{"key":"e_1_3_2_1_17_1","first-page":"126","volume-title":"Experimental Evaluation of a New Shortest Path Algorithm_(Extended Abstract)","author":"Seth Pettie","year":"2002","unstructured":"Seth Pettie , Vijaya Ramachandran, and Srinath Sr idhar 2002 ,: Experimental Evaluation of a New Shortest Path Algorithm_(Extended Abstract) . In D. Mount and C. Stein (Eds.): ALENEX 2002, LNCS 2409, pp. 126 -- 142 , 2002 . Springer-Verlag Berlin Heidelberg ( 2002) Seth Pettie, Vijaya Ramachandran, and Srinath Sridhar 2002,: Experimental Evaluation of a New Shortest Path Algorithm_(Extended Abstract). In D. Mount and C. Stein (Eds.): ALENEX 2002, LNCS 2409, pp. 126--142, 2002. Springer-Verlag Berlin Heidelberg (2002)"},{"key":"e_1_3_2_1_18_1","first-page":"59","volume-title":"Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM","author":"Therup M.","year":"1996","unstructured":"Therup , M. : On RAM priority queues. 1996 , In Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM , New York , pp. 59 -- 67 ( 1996 ) Therup, M.: On RAM priority queues. 1996, In Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, pp. 59--67 (1996)"},{"key":"e_1_3_2_1_19_1","series-title":"Lecture Notes on Computer Science","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/BFb0028545","volume-title":"Proceedings of the 15th Symposium on Theoretical Aspects of Computer Science","author":"Thorup M.","year":"1998","unstructured":"Thorup , M. 1998, Floats , integers, and single source shortest paths . In Proceedings of the 15th Symposium on Theoretical Aspects of Computer Science . Lecture Notes on Computer Science , vol. 1373 . Springer-Verlag , New York , pp. 14 -- 24 .( 1998 ) Thorup, M. 1998, Floats, integers, and single source shortest paths. In Proceedings of the 15th Symposium on Theoretical Aspects of Computer Science. Lecture Notes on Computer Science, vol. 1373. Springer-Verlag, New York, pp. 14--24.( 1998)"},{"key":"e_1_3_2_1_20_1","first-page":"6","volume":"7","author":"Williams J. W. J.","year":"1998","unstructured":"Williams , J. W. J. , 1998 , Heapsort. Commun. In ACM 7 , 6 (June), 347--348. (1998) Williams, J. W. J., 1998, Heapsort. Commun. In ACM 7, 6 (June), 347--348. (1998)","journal-title":"Heapsort. Commun. In ACM"}],"event":{"name":"FIT '09: 7th International Conference on Frontiers of Information Technology","sponsor":["COMSATS Institute of Information Technology","SIGAI ACM Special Interest Group on Artificial Intelligence"],"location":"Abbottabad Pakistan","acronym":"FIT '09"},"container-title":["Proceedings of the 7th International Conference on Frontiers of Information Technology"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1838002.1838079","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1838002.1838079","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:41:11Z","timestamp":1750250471000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1838002.1838079"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12,16]]},"references-count":20,"alternative-id":["10.1145\/1838002.1838079","10.1145\/1838002"],"URL":"https:\/\/doi.org\/10.1145\/1838002.1838079","relation":{},"subject":[],"published":{"date-parts":[[2009,12,16]]},"assertion":[{"value":"2009-12-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}