{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:44:02Z","timestamp":1759063442357},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,2,28]],"date-time":"2014-02-28T00:00:00Z","timestamp":1393545600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s10766-013-0300-7","type":"journal-article","created":{"date-parts":[[2014,2,27]],"date-time":"2014-02-27T12:02:39Z","timestamp":1393502559000},"page":"240-259","source":"Crossref","is-referenced-by-count":1,"title":["A Parallel Implementation for the Negative Cost Girth Problem"],"prefix":"10.1007","volume":"43","author":[{"given":"Matthew","family":"Williamson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Subramani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,2,28]]},"reference":[{"key":"300_CR1","doi-asserted-by":"crossref","unstructured":"Amdahl, G.M.: Validity of the single processor approach to achieving large scale computing capabilities. In: Proceedings of the April 18\u201320. 1967, spring joint computer conference, AFIPS \u201967 (Spring), pp. 483\u2013485. NY, USA. ACM, New York (1967)","DOI":"10.1145\/1465482.1465560"},{"key":"300_CR2","volume-title":"The VLSI Handbook","author":"W-K Chen","year":"2006","unstructured":"Chen, W.-K.: The VLSI Handbook, 2nd edn. CRC Press Inc, Boca Raton, FL, USA (2006)","edition":"2"},{"issue":"2","key":"300_CR3","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1109\/71.127265","volume":"3","author":"GH Chen","year":"1992","unstructured":"Chen, G.H., Wang, B.F., Lu, C.J.: On the parallel computation of the algebraic path problem. IEEE Trans. Parallel Distrib. Syst. 3(2), 251\u2013256 (1992)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"2","key":"300_CR4","first-page":"150","volume":"26","author":"GH Chen","year":"1995","unstructured":"Chen, G.H., Olariu, S., Schwing, J.L., Wang, B.F., Zhang, J.: Constant-time tree algorithms on reconfigurable meshes of size $$n \\times n$$ n \u00d7 n . J. Parallel Distrib. Comput. 26(2), 150\u2013187 (1995)","journal-title":"J. Parallel Distrib. Comput."},{"key":"300_CR5","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge, MA (2009)","edition":"3"},{"key":"300_CR6","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269\u2013271 (1959)","journal-title":"Numer. Math."},{"issue":"4","key":"300_CR7","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1137\/0210049","volume":"10","author":"E Dekel","year":"1981","unstructured":"Dekel, E., Nassimi, D., Sahni, S.: Parallel matrix and graph algorithms. SIAM J. Comput. 10(4), 657\u2013675 (1981)","journal-title":"SIAM J. Comput."},{"key":"300_CR8","unstructured":"Demetrescu, C., Goldberg, A.V., Johnson, D.: 9th DIMACS implementation challenge\u2014shortest paths. http:\/\/www.dis.uniroma1.it\/challenge9\/ (2005)"},{"issue":"6","key":"300_CR9","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"RW Floyd","year":"1962","unstructured":"Floyd, R.W.: Algorithm 97: Shortest path. Commun. ACM 5(6), 345 (1962)","journal-title":"Commun. ACM"},{"issue":"4","key":"300_CR10","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/BF02523680","volume":"17","author":"Y Han","year":"1997","unstructured":"Han, Y., Pan, V.Y., Reif, J.H.: Efficient parallel algorithms for computing all pair shortest paths in directed graphs. Algorithmica 17(4), 399\u2013415 (1997)","journal-title":"Algorithmica"},{"key":"300_CR11","unstructured":"JaJa, J.: Introduction to Parallel Algorithms, 1st edn. Addison Wesley, Reading (1992)."},{"issue":"1","key":"300_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/321992.321993","volume":"24","author":"DB Johnson","year":"1977","unstructured":"Johnson, D.B.: Efficient algorithms for shortest paths in sparse networks. J. ACM 24(1), 1\u201313 (1977)","journal-title":"J. ACM"},{"issue":"2","key":"300_CR13","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0020-0190(82)90093-X","volume":"14","author":"L Kucera","year":"1982","unstructured":"Kucera, L.: Parallel computation and conflicts in memory access. Inf. Process. Lett. 14(2), 93\u201396 (1982)","journal-title":"Inf. Process. Lett."},{"key":"300_CR14","doi-asserted-by":"crossref","unstructured":"Pan, V.Y., Preparata, F.P.: Supereffective slow-down of parallel computations. In: Proceedings of the Fourth Annual ACM Symposium on Parallel Algorithms and Architectures. SPAA \u201992, pp. 402\u2013409. NY, USA. ACM, New York (1992)","DOI":"10.1145\/140901.141926"},{"issue":"3","key":"300_CR15","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1137\/0224051","volume":"24","author":"VY Pan","year":"1995","unstructured":"Pan, V.Y., Preparata, F.P.: Work-preserving speed-up of parallel matrix computations. SIAM J. Comput. 24(3), 811\u2013821 (1995)","journal-title":"SIAM J. Comput."},{"key":"300_CR16","volume-title":"Parallel Programming in C with MPI and OpenMP","author":"MJ Quinn","year":"2003","unstructured":"Quinn, M.J.: Parallel Programming in C with MPI and OpenMP. McGraw-Hill Education Group, New York (2003)"},{"issue":"2","key":"300_CR17","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1137\/0214030","volume":"14","author":"R Reischuk","year":"1985","unstructured":"Reischuk, R.: Probabilistic parallel algorithms for sorting and selection. SIAM J. Comput. 14(2), 396\u2013409 (1985)","journal-title":"SIAM J. Comput."},{"key":"300_CR18","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195078817.001.0001","volume-title":"The Design and Analysis of Parallel Algorithms","author":"JR Smith","year":"1993","unstructured":"Smith, J.R.: The Design and Analysis of Parallel Algorithms. Oxford University Press, New York, NY, USA (1993)"},{"issue":"2","key":"300_CR19","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s10817-009-9139-4","volume":"43","author":"K Subramani","year":"2009","unstructured":"Subramani, K.: Optimal length resolution refutations of difference constraint systems. J. Autom. Reason. (JAR) 43(2), 121\u2013137 (2009)","journal-title":"J. Autom. Reason. (JAR)"},{"issue":"2","key":"300_CR20","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/s00165-011-0186-3","volume":"25","author":"K Subramani","year":"2013","unstructured":"Subramani, K., Williamson, M., Gu, X.: Improved algorithms for optimal length resolution refutation in difference constraint systems. Formal Asp. Comput. 25(2), 319\u2013341 (2013)","journal-title":"Formal Asp. Comput."},{"issue":"3","key":"300_CR21","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1137\/0204030","volume":"4","author":"LG Valiant","year":"1975","unstructured":"Valiant, L.G.: Parallelism in comparison models. SIAM J. Comput. 4(3), 348\u2013355 (1975)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"300_CR22","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1109\/71.80177","volume":"1","author":"BF Wang","year":"1990","unstructured":"Wang, B.F., Chen, G.H.: Constant time algorithms for the transitive closure and some related graph problems on processor arrays with reconfigurable bus systems. IEEE Trans. Parallel Distrib. Syst. 1(4), 500\u2013507 (1990)","journal-title":"IEEE Trans. Parallel Distrib. Syst."}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-013-0300-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10766-013-0300-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-013-0300-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,24]],"date-time":"2024-05-24T17:19:56Z","timestamp":1716571196000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10766-013-0300-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,28]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["300"],"URL":"https:\/\/doi.org\/10.1007\/s10766-013-0300-7","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"value":"0885-7458","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,28]]}}}