{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:42Z","timestamp":1725490242483},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540412557"},{"type":"electronic","value":"9783540409960"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-40996-3_40","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T21:17:32Z","timestamp":1188335852000},"page":"467-478","source":"Crossref","is-referenced-by-count":0,"title":["Finding a Two-Core of a Tree in Linear Time"],"prefix":"10.1007","author":[{"given":"Biing-Feng","family":"Wang","sequence":"first","affiliation":[]},{"given":"Jyh-Jye","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,1,29]]},"reference":[{"issue":"2","key":"40_CR1","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/S0166-218X(85)80002-0","volume":"11","author":"R. I. Becker","year":"1985","unstructured":"R. I. Becker and Y. Perl, \u201cFinding the two-core of a tree,\u201d Discrete Applied Mathematics, vol. 11, no. 2, pp.103\u2013113, 1985.","journal-title":"Discrete Applied Mathematics"},{"key":"40_CR2","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1002\/net.3230260413","volume":"26","author":"B. Gavih","year":"1995","unstructured":"B. Gavih and S. Sridhar, \u201cComputing the 2-median on tree networks in O(nlg n) time,\u201d Networks, vol. 26, iss. 4, pp. 305\u2013317, 1995.","journal-title":"Networks"},{"key":"40_CR3","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1287\/trsc.5.2.212","volume":"5","author":"A.J. Goldman","year":"1971","unstructured":"A.J. Goldman, \u201cOptimal center location in simple networks\u201d, Transportation Science, vol. 5, pp. 212\u2013221, 1971.","journal-title":"Transportation Science"},{"key":"40_CR4","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1002\/net.3230230605","volume":"23","author":"S. L. Hakimi","year":"1993","unstructured":"S. L. Hakimi, E. F. Schmeichel, and M. Labbe, \u201cOn locating path-or tree-shaped facilities on networks,\u201d Networks, vol. 23, pp. 543\u2013555, 1993.","journal-title":"Networks"},{"key":"40_CR5","volume-title":"Location on Networks","author":"G.Y. Handler","year":"1979","unstructured":"G.Y. Handler and P. Mirchandani, Location on Networks, MIT Press, Cambridge, MA, 1979."},{"key":"40_CR6","unstructured":"D.E. Knuth, The Art of Computer Programming, vol. 1, Addison-Wesley, Reading, MA, 1968."},{"key":"40_CR7","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1137\/0210023","volume":"10","author":"N. Megiddo","year":"1981","unstructured":"N. Megiddo, A. Tamir, E. Zemel, and R. Chandrasekaran, \u201cAn O(nlog2 n) time algorithm for the kth longest path in a tree with applications to location problems,\u201d SIAM Journal on Computing, vol. 10, pp. 328\u2013337, 1981.","journal-title":"SIAM Journal on Computing"},{"key":"40_CR8","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0196-6774(83)90015-9","volume":"4","author":"E. Minieka","year":"1983","unstructured":"E. Minieka and N.H. Patel, \u201cOn finding the core of a tree with a specified length\u201d, Journal of Algorithms, vol. 4, pp. 345\u2013352, 1983.","journal-title":"Journal of Algorithms"},{"key":"40_CR9","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0196-6774(80)90012-7","volume":"1","author":"C.A. Morgan","year":"1980","unstructured":"C.A. Morgan and P.L. Slater, \u201cA linear time algorithm for a core of a tree\u201d, Journal of Algorithms, vol. 1, pp. 247\u2013258, 1980.","journal-title":"Journal of Algorithms"},{"key":"40_CR10","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1006\/jagm.1993.1034","volume":"15","author":"S. Peng","year":"1996","unstructured":"S. Peng and W. Lo, \u201cEfficient algorithms for finding a core of a tree with specified length\u201d, Journal of Algorithms, vol. 15, pp. 143\u2013159, 1996.","journal-title":"Journal of Algorithms"},{"key":"40_CR11","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1006\/jagm.1996.0838","volume":"23","author":"A. Shioura","year":"1997","unstructured":"A. Shioura and T. Uno, \u201cA linear time algorithm for finding a k-tree core,\u201d Journal of Algorithms, vol. 23, pp. 281\u2013290, 1997.","journal-title":"Journal of Algorithms"},{"issue":"1","key":"40_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.16.1.1","volume":"16","author":"P.J. Slater","year":"1982","unstructured":"P.J. Slater, \u201cLocating central paths in a network\u201d, Transportation Science, vol. 16, no. 1, pp.1\u201318, 1982.","journal-title":"Transportation Science"},{"issue":"2","key":"40_CR13","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0167-6377(96)00021-1","volume":"19","author":"A. Tamir","year":"1996","unstructured":"A. Tamir, \u201cAn O(pn2) time algorithm for the p-median and related problems on tree graphs,\u201d Operations Research Letters, vol. 19, iss. 2, pp. 59\u201364, 1996.","journal-title":"Operations Research Letters"},{"issue":"2","key":"40_CR14","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1109\/71.663884","volume":"9","author":"B.-F. Wang","year":"1999","unstructured":"B.-F. Wang, \u201cFinding a k-tree core and a k-tree center of tree network in parallel\u201d, IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 2, pp. 186\u2013191, 1999.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"40_CR15","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1006\/jagm.1999.1020","volume":"34","author":"B.-F. Wang","year":"2000","unstructured":"B.-F. Wang, \u201cEfficient parallel algorithms for optimally locating a path and a tree of a specified length in a weighted tree network\u201d, Journal of Algorithms, vol. 34, pp. 90\u2013108, 2000.","journal-title":"Journal of Algorithms"},{"key":"40_CR16","unstructured":"B.-F. Wang, \u201cFinding a 2-core of a tree in linear time\u201d, manuscript."},{"key":"40_CR17","doi-asserted-by":"crossref","unstructured":"B.-F. Wang, S.-C. Ku, K.-H. Shi, T.-K. Hung, and P.-S. Liu, \u201cParallel algorithms for the tree bisector problem and applications,\u201d in Proceedings of the 1999 International Conference on Parallel Processing, 1999, pp. 192\u2013199.","DOI":"10.1109\/ICPP.1999.797404"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-40996-3_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T23:56:44Z","timestamp":1550879804000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-40996-3_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540412557","9783540409960"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-40996-3_40","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}