{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:55:08Z","timestamp":1742990108670,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642221903"},{"type":"electronic","value":"9783642221910"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22191-0_57","type":"book-chapter","created":{"date-parts":[[2011,6,28]],"date-time":"2011-06-28T00:22:53Z","timestamp":1309220573000},"page":"663-671","source":"Crossref","is-referenced-by-count":0,"title":["Embedded Backups for Link Failure Recovery in Shortest Path Trees"],"prefix":"10.1007","author":[{"given":"Muhammad Aasim","family":"Qureshi","sequence":"first","affiliation":[]},{"given":"Mohd Fadzil","family":"Hassan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"57_CR1","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10878-006-9000-1","volume":"12","author":"B. Zhang","year":"2006","unstructured":"Zhang, B., Zhang, J., Qi, L.: The shortest path improvement problems under Hamming distance. Journal of Combinatorial Optimization\u00a012, 351\u2013361 (2006)","journal-title":"Journal of Combinatorial Optimization"},{"key":"57_CR2","doi-asserted-by":"crossref","unstructured":"Safdar, S., Hassan, M.F.: Moving Towards Two Dimensional Passwords. In: 4th International Symposium on Information Technology, pp. 891\u2013896 (2010)","DOI":"10.1109\/ITSIM.2010.5561566"},{"key":"57_CR3","doi-asserted-by":"crossref","unstructured":"Safdar, S., Hassan, M.F.: Framework for Alternate Execution of workflows under threat. In: 2nd International Conference on Communication Software and Networks, Singapore (2010)","DOI":"10.1109\/ICCSN.2010.79"},{"key":"57_CR4","doi-asserted-by":"crossref","unstructured":"Akbar, R., Hassan, M.F.: Limitations and Measures in Outsourcing Projects to Geographically Distributed Offshore Teams. In: 4th International Symposium on Information Technology, KL, Malaysia, pp. 1581\u20131585 (2010)","DOI":"10.1109\/ITSIM.2010.5561457"},{"key":"57_CR5","doi-asserted-by":"crossref","unstructured":"Akbar, R., Hassan, M.F.: A Collaborative\u2013Interaction Approach of Software Project Development\u2013An Extension to Agile Base Methodologies. In: 4th International Symposium on Information Technology, KL, Malaysia, pp. 133\u2013138 (2010)","DOI":"10.1109\/ITSIM.2010.5561417"},{"key":"57_CR6","volume-title":"International Conference on Teaching and Learning 2007","author":"M.A. Qureshi","year":"2007","unstructured":"Qureshi, M.A., Maqbool, O.: The Complexity of Teaching: Computability and Complexity. In: International Conference on Teaching and Learning 2007, INTI International University College at Putrajaya, Malaysia (2007)"},{"key":"57_CR7","first-page":"171","volume":"1","author":"M.A. Qureshi","year":"2007","unstructured":"Qureshi, M.A., Maqbool, O.: The Complexity of Teaching: Computability and Complexity. INTI Journal Special Issue on Teaching and Learnning\u00a01, 171\u2013182 (2007)","journal-title":"INTI Journal Special Issue on Teaching and Learnning"},{"key":"57_CR8","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connection with graphs. Numerische Mathematik\u00a01, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"57_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1186810.1186815","volume":"3","author":"J. Hershberger","year":"2007","unstructured":"Hershberger, J., Suri, S., Bhosle, A.M.: On the Difficulty of Some Shortest Path Problems. ACM Transactions on Algorithms\u00a03, 1\u201315 (2007)","journal-title":"ACM Transactions on Algorithms"},{"key":"57_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/3-540-45643-0_10","volume-title":"Algorithm Engineering and Experiments","author":"S. Pettie","year":"2002","unstructured":"Pettie, S., Ramachandran, V., Sridhar, S.: Experimental evaluation of a new shortest path algorithm. In: Mount, D.M., Stein, C. (eds.) ALENEX 2002. LNCS, vol.\u00a02409, pp. 126\u2013142. Springer, Heidelberg (2002)"},{"key":"57_CR11","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1006\/jagm.2000.1080","volume":"35","author":"M. Thorup","year":"2000","unstructured":"Thorup, M.: Floats, Integers, and Single Source Shortest Paths. Journal of Algorithms\u00a035, 189\u2013201 (2000)","journal-title":"Journal of Algorithms"},{"key":"57_CR12","doi-asserted-by":"crossref","unstructured":"Thorup, M.: Floats, Integers, and Single Source Shortest Paths *. In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol.\u00a01373, Springer, Heidelberg (1998)","DOI":"10.1007\/BFb0028545"},{"key":"57_CR13","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1145\/261342.261352","volume":"28","author":"R. Raman","year":"1997","unstructured":"Raman, R.: Recent Results on the Single-Source Shortest Paths Problem. SIGACT News\u00a028, 81\u201387 (1997)","journal-title":"SIGACT News"},{"key":"57_CR14","unstructured":"Bhosle, A.M., Gonzalez, T.F.: Efficient Algorithms for Single Link Failure Recovery and Its Application to ATM Networks. In: 15th IASTED Intl. Conf. on PDCS, pp. 87\u201392 (2003)"},{"key":"57_CR15","doi-asserted-by":"crossref","unstructured":"Bhosle, A.M., Gonzalez, T.F.: Distributed Algorithms for Computing Alternate Paths Avoiding Failed Nodes and Links. eprint arXiv:0811.1301, vol. abs\/0811.1 (2008)","DOI":"10.1055\/s-2008-1077936"},{"key":"57_CR16","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1109\/NCM.2008.56","volume-title":"Fourth International Conference on Networked Computing and Advanced Information Management","author":"Y. Li","year":"2008","unstructured":"Li, Y., Nie, Z., Zhou, X.: Finding the Optimal Shortest Path Tree with Respect to Single Link Failure Recovery. In: Fourth International Conference on Networked Computing and Advanced Information Management, pp. 412\u2013415. IEEE, Los Alamitos (2008)"},{"key":"57_CR17","doi-asserted-by":"crossref","unstructured":"Qureshi, M.A., Hassan, M.F., Safdar, S., Akbar, R., Sammi, R.: Shortest Path Algorithm With Pre-calculated Single Link Failure Recovery for Non-Negative Weighted Undirected Graphs. In: International Conference on Information and Emerging Technologies (ICIET), pp. 1\u20135 (2010)","DOI":"10.1109\/ICIET.2010.5625724"},{"key":"57_CR18","doi-asserted-by":"crossref","unstructured":"Qureshi, M.A., Hassan, M.F., Safdar, S., Akbar, R.: A Near Linear Shortest Path Algorithm for Weighted Undirected Graphs. In: 2011 IEEE Symposium on Computers & Informatics, KL, Malaysia (2011) (accepted)","DOI":"10.1109\/ISCI.2011.5958895"},{"key":"57_CR19","doi-asserted-by":"crossref","unstructured":"Qureshi, M.A., Hassan, M.F., Safdar, S., Akbar, R.: Two Phase Shortest Path Algorithm for Non-negative Weighted Undirected Graphs. In: IEEE 2010 Second International Conference on Communication Software and Networks, pp. 223\u2013227 (2010)","DOI":"10.1109\/ICCSN.2010.97"},{"key":"57_CR20","doi-asserted-by":"crossref","unstructured":"Qureshi, M.A., Hassan, M.F.: Improvements over Two Phase Shortest Path Algorithm. In: 4th International Symposium on Information Technology, ITSIM 2010 (2010)","DOI":"10.1109\/ITSIM.2010.5561538"}],"container-title":["Communications in Computer and Information Science","Software Engineering and Computer Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22191-0_57","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T19:23:50Z","timestamp":1741289030000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22191-0_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642221903","9783642221910"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22191-0_57","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2011]]}}}