{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:49Z","timestamp":1725664189222},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540583257"},{"type":"electronic","value":"9783540486534"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58325-4_190","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:43:45Z","timestamp":1330271025000},"page":"270-278","source":"Crossref","is-referenced-by-count":6,"title":["Efficient sequential and parallel algorithms for the negative cycle problem"],"prefix":"10.1007","author":[{"given":"Dimitris","family":"Kavvadias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grammati E.","family":"Pantziou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul G.","family":"Spirakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos D.","family":"Zaroliagis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0196-6774(89)90017-5","volume":"10","author":"K. Abrahamson","year":"1989","unstructured":"K. Abrahamson, N. Dadoun, D. Kirkpatrick and T. Przytycka, \u201cA Simple Parallel Tree Contraction Algorithm\u201d, J. of Algorithms, 10(1989), pp.287\u2013302.","journal-title":"J. of Algorithms"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"E. Cohen, \u201cEfficient Parallel Shortest-paths in Digraphs with a Separator Decomposition\u201d, Proc. 5th ACM SPAA, 1993, pp.57\u201367.","DOI":"10.1145\/165231.165240"},{"key":"32_CR3","unstructured":"T. Cormen, C. Leiserson and R. Rivest, \u201cIntroduction to Algorithms\u201d, MIT Press & McGraw Hill, 1990."},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"K. Diks, T. Hagerup and W. Rytter, \u201cOptimal Parallel Algorithms for the Recognition and Colouring of Outerplanar Graphs\u201d, Proc. MFCS'89, LNCS 379.","DOI":"10.1007\/3-540-51486-4_68"},{"key":"32_CR5","first-page":"369","volume":"11","author":"H. Djidjev","year":"1895","unstructured":"H. Djidjev, \u201cA Linear Algorithm for Partitioning Graphs of Fixed Genus\u201d, SERDICA, Vol.11, 1895, pp.369\u2013387.","journal-title":"SERDICA"},{"key":"32_CR6","first-page":"327","volume":"510","author":"H. Djidjev","year":"1991","unstructured":"H. Djidjev, G. Pantziou and C. Zaroliagis, \u201cComputing Shortest Paths and Distances in Planar Graphs\u201d, in Proc. 18th ICALP, 1991, LNCS 510, pp. 327\u2013339.","journal-title":"LNCS"},{"key":"32_CR7","unstructured":"P. Erd\u0151s and J. Spencer, \u201cProbabilistic Methods in Combinatorics\u201d, Academic Press, 1974."},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"G.N. Frederickson, \u201cUsing Cellular Graph Embeddings in Solving All Pairs Shortest Path Problems\u201d, Proc. 30th IEEE Symp. on FOCS, 1989, pp.448\u2013453.","DOI":"10.1109\/SFCS.1989.63517"},{"issue":"No.1","key":"32_CR9","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1145\/102782.102788","volume":"38","author":"G.N. Frederickson","year":"1991","unstructured":"G.N. Frederickson, \u201cPlanar Graph Decomposition and All Pairs Shortest Paths\u201d, J. ACM, Vol.38, No.1, January 1991, pp.162\u2013204.","journal-title":"J. ACM"},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M. Fredman","year":"1987","unstructured":"M. Fredman and R. Tarjan, \u201cFibonacci heaps and their uses in improved network optimization algorithms\u201d, JACM, 34(1987), pp. 596\u2013615.","journal-title":"JACM"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Y. Han, V. Pan and J. Reif, \u201cEfficient Parallel Algorithms for Computing All Pair Shortest Paths in Directed Graphs\u201d, Proc. 4th ACM SPAA, 1992, pp.353\u2013362.","DOI":"10.1145\/140901.141913"},{"key":"32_CR12","unstructured":"D. Kavvadias, G. Pantziou, P. Spirakis and C. Zaroliagis, \u201cHammock-on-Ears Decomposition: A Technique for Parallel and On-line Path Problems\u201d, CTI Technical Report, TR-93.05.22, Patras, 1993."},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"D. Kavvadias, G. Pantziou, P. Spirakis and C. Zaroliagis, \u201cHammock-on-Ears Decomposition: A Technique for the Efficient Parallel Solution of Shortest Paths and Other Problems\u201d, Proc. 19th MFCS 94, LNCS, to appear.","DOI":"10.1007\/3-540-58338-6_93"},{"key":"32_CR14","unstructured":"E.L. Lawler, \u201cCombinatorial Optimization: Networks and Matroids\u201d, Holt, Rinehart and Winston, 1976."},{"key":"32_CR15","unstructured":"T. Lengauer, \u201cEfficient Algorithms for the Constraint Generation and Intergrated Circuit Layout Compaction\u201d, Proc. 9th WG83, pp.219\u2013230, 1983."},{"key":"32_CR16","doi-asserted-by":"crossref","unstructured":"A. Lingas, \u201cEfficient Parallel Algorithms for Path Problems in Planar Directed Graphs\u201d, Proc. SIGAL 90, LNCS 450, pp.447\u2013457, 1990, Springer-Verlag.","DOI":"10.1007\/3-540-52921-7_94"},{"issue":"N.4","key":"32_CR17","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1137\/0208048","volume":"8","author":"D. Maier","year":"1979","unstructured":"D. Maier, \u201cAn Efficient Method for Storing Ancestor Information in Trees\u201d, SIAM J. on Comp., Vol.8, N.4, pp.599\u2013618, 1979.","journal-title":"SIAM J. on Comp."},{"key":"32_CR18","first-page":"302","volume":"158","author":"K. Mehlhorn","year":"1983","unstructured":"K. Mehlhorn and B. Schmidt, \u201cA Single Source Shortest Path Algorithm for Graphs with Separators\u201d, in Proc. FCT83, LNCS 158, pp.302\u2013309, 1983.","journal-title":"LNCS"},{"key":"32_CR19","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01994878","volume":"32","author":"G. Pantziou","year":"1992","unstructured":"G. Pantziou, P. Spirakis and C. Zaroliagis, \u201cEfficient Parallel Algorithms for Shortest Paths in Planar Digraphs\u201d, BIT 32 (1992), pp.215\u2013236.","journal-title":"BIT"},{"key":"32_CR20","unstructured":"C.H. Papadimitriou and K. Steiglitz, \u201cCombinatorial Optimization: Algorithms and Complexity\u201d, Prentice-Hall, 1982."},{"key":"32_CR21","doi-asserted-by":"crossref","unstructured":"P. Spirakis and A. Tsakalidis, \u201cA Very Fast, Practical Algorithm for Finding a Negative Cycle in a Digraph\u201d, in Proc. of 13th ICALP, pp. 397\u2013406, 1986.","DOI":"10.1007\/3-540-16761-7_89"},{"key":"32_CR22","doi-asserted-by":"crossref","unstructured":"R.E. Tarjan, \u201cData Structures and Network Algorithms\u201d, SIAM, 1983.","DOI":"10.1137\/1.9781611970265"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58325-4_190.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:13:37Z","timestamp":1619572417000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58325-4_190"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540583257","9783540486534"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-58325-4_190","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}