{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:58:10Z","timestamp":1725573490573},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540309352"},{"type":"electronic","value":"9783540324263"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11602613_56","type":"book-chapter","created":{"date-parts":[[2005,12,2]],"date-time":"2005-12-02T08:24:24Z","timestamp":1133511864000},"page":"553-562","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Parallel Algorithms for Constructing a k-Tree Center and a k-Tree Core of a Tree Network"],"prefix":"10.1007","author":[{"given":"Yan","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deqiang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baoyu","family":"Tian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"56_CR1","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0020-0190(88)90186-X","volume":"26","author":"R. Cole","year":"1988","unstructured":"Cole, R.: An Optimally Efficient Selection Algorithm. Information Processing Letters\u00a026, 295\u2013299 (1988)","journal-title":"Information Processing Letters"},{"key":"56_CR2","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1137\/0217009","volume":"17","author":"R. Cole","year":"1983","unstructured":"Cole, R., Vishkin, U.: Approximate Parallel Scheduling, Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time. SIAM J. Computing\u00a017, 128\u2013142 (1983)","journal-title":"SIAM J. Computing"},{"key":"56_CR3","volume-title":"Location on Network","author":"G.Y. Handler","year":"1979","unstructured":"Handler, G.Y., Mirchandani, P.: Location on Network. MIT Press, Cambridge (1979)"},{"key":"56_CR4","volume-title":"An Introduction to Parallel Algorithms","author":"J. Jaja","year":"1992","unstructured":"Jaja, J.: An Introduction to Parallel Algorithms. Addison Wesley, Reading (1992)"},{"key":"56_CR5","doi-asserted-by":"crossref","unstructured":"Miller, G.L., Reif, J.: Parallel Tree Contraction and Its Applications. In: Proc. 26th Ann. IEEE Symp. Foundations of Computer Science, pp. 478\u2013489 (1985)","DOI":"10.1109\/SFCS.1985.43"},{"key":"56_CR6","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0196-6774(83)90015-9","volume":"4","author":"E. Minieka","year":"1983","unstructured":"Minieka, E., Patel, N.H.: On finding the core of a tree with a specified length. Journal of Algorithms\u00a04, 345\u2013352 (1983)","journal-title":"Journal of Algorithms"},{"key":"56_CR7","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1080\/10637199408915406","volume":"2","author":"S. Peng","year":"1994","unstructured":"Peng, S., Wang, T.: The Optimal Location of a Structured Facility in a Tree Network. Parallel Algorithms and Applications\u00a02, 43\u201360 (1994)","journal-title":"Parallel Algorithms and Applications"},{"key":"56_CR8","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1006\/jagm.1993.1034","volume":"15","author":"S. Peng","year":"1993","unstructured":"Peng, S., Stephens, A.B., Yesha, Y.: Algorithms for a Core and k-tree Core of a Tree. J. Algorithms\u00a015, 143\u2013159 (1993)","journal-title":"J. Algorithms"},{"key":"56_CR9","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.jpdc.2004.09.001","volume":"65","author":"F.E. Sevilgen","year":"2005","unstructured":"Sevilgen, F.E., Aluru, S., Futamura, F.: Parallel algorithms for tree accumulations. J. Parallel Distrib. Comput.\u00a065, 85\u201393 (2005)","journal-title":"J. Parallel Distrib. Comput."},{"key":"56_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.16.1.1","volume":"16","author":"P.J. Slater","year":"1982","unstructured":"Slater, P.J.: Locating central paths in a network. Transportation Science\u00a016, 1\u201318 (1982)","journal-title":"Transportation Science"},{"key":"56_CR11","first-page":"861","volume":"14","author":"R.E. Tarjan","year":"1985","unstructured":"Tarjan, R.E., Vishkin, U.: Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time. SIAM J. Computing\u00a014, 861\u2013874 (1985)","journal-title":"SIAM J. Computing"},{"key":"56_CR12","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1287\/mnsc.29.4.482","volume":"29","author":"B.C. Tansel","year":"1983","unstructured":"Tansel, B.C., Francis, R.L., Lowe, T.J.: Location on Networks: a Survey. Management Science\u00a029, 482\u2013511 (1983)","journal-title":"Management Science"},{"key":"56_CR13","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1109\/71.663884","volume":"9","author":"B.F. Wang","year":"1998","unstructured":"Wang, B.F.: Finding a k-tree core and a k-tree center of a tree network in parallel. IEEE Transactions on Parallel and Distributed Systems\u00a09, 186\u2013191 (1998)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11602613_56.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:02:58Z","timestamp":1619506978000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11602613_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309352","9783540324263"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11602613_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}