{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:24:05Z","timestamp":1725495845841},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540669166"},{"type":"electronic","value":"9783540466321"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46632-0_18","type":"book-chapter","created":{"date-parts":[[2007,11,24]],"date-time":"2007-11-24T14:45:01Z","timestamp":1195915501000},"page":"173-182","source":"Crossref","is-referenced-by-count":2,"title":["Parallel Algorithms for Shortest Paths and Related Problems on Trapezoid Graphs"],"prefix":"10.1007","author":[{"given":"F. R.","family":"Hsu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaw-Ling","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yin-Te","family":"Tsai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,3,3]]},"reference":[{"key":"18_CR1","volume-title":"Prentice Hall","author":"S.G. Akl","year":"1997","unstructured":"S.G. Akl, \u201cParallel computation: models and methods\u201d, Prentice Hall, Upper Saddle River, New Jersey, 1997."},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0166-218X(88)90032-7","volume":"21","author":"I. Dagan","year":"1988","unstructured":"I. Dagan, M.C. Golumbic and R.Y. Pinter, \u201cTrapezoid graphs and their coloring\u201d, Discr. Applied Math.,21:35\u201346,1988.","journal-title":"Discr. Applied Math"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"D.Z. Chen, D. T. Lee, R. Sridhar and C. N. Sekharan, \u201cSolving the all-pair shortest path query problem on interval and circular-arc graphs\u201d, Networks, pp. 249\u2013257, 1998.","DOI":"10.1002\/(SICI)1097-0037(199807)31:4<249::AID-NET5>3.0.CO;2-D"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0166-218X(95)00062-V","volume":"63","author":"Flotow","year":"1995","unstructured":"Flotow, \u201cOn Powers of m-Trapezoid Graphs\u201d, Discr. Applied Math., 63:187\u2013192, 1995.","journal-title":"Discr. Applied Math"},{"key":"18_CR5","first-page":"132","volume-title":"Proc. Of the 1998 International Computer Symposium, Workshop on Algorithms","author":"H.S. Chao","year":"1998","unstructured":"H.S. Chao, F.R. Hsu and R.C.T. Lee, \u201cOn the Shortest Length Queries for Permutation Graphs\u201d, Proc. Of the 1998 International Computer Symposium, Workshop on Algorithms, NCKU, Taiwan, pp. 132\u2013138, 1998."},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1006\/jpdc.1995.1009","volume":"24","author":"O.H. Ibarra","year":"1995","unstructured":"O.H. Ibarra and Q. Zheng, \u201cAn optimal shortest path parallel algorithm for permutation graphs\u201d, J. of Parallel and Distributed Computing, 24:94\u201399, 1995.","journal-title":"J. of Parallel and Distributed Computing"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/S0166-218X(96)00133-3","volume":"77","author":"D. Kratsch","year":"1997","unstructured":"Dieter Kratsch, Ton Kloks and Haiko M\u00fcller, \u201cMeasuring the vulnerability for classes of intersection graphs\u201d, Discr. Applied Math., 77:259\u2013270, 1997.","journal-title":"Discr. Applied Math"},{"issue":"2","key":"18_CR8","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0020-0190(95)00118-V","volume":"56","author":"Y. D. Liang","year":"1995","unstructured":"Y. D. Liang, \u201cSteiner set and connected domination in trapezoid graphs\u201d, Information Processing Letters, 56(2):101\u2013108, 1995.","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46632-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T16:41:14Z","timestamp":1551112874000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46632-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540669166","9783540466321"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-46632-0_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}