{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:25:38Z","timestamp":1762100738405},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540748380"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74839-7_11","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T14:55:58Z","timestamp":1196952958000},"page":"109-120","source":"Crossref","is-referenced-by-count":15,"title":["The 3-Steiner Root Problem"],"prefix":"10.1007","author":[{"given":"Maw-Shang","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming-Tat","family":"Ko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/j.ipl.2006.01.004","volume":"98","author":"A. Brandst\u00e4dt","year":"2006","unstructured":"Brandst\u00e4dt, A., Van Bang Le: Structure and linear time recognition of 3-leaf powers. Information Processing Letters\u00a098, 133\u2013138 (2006)","journal-title":"Information Processing Letters"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/11785293_38","volume-title":"Algorithm Theory \u2013 SWAT 2006","author":"M.-S. Chang","year":"2006","unstructured":"Chang, M.-S., Ko, M.-T., Lu, H.-I.: Linear time algorithms for tree root problems. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol.\u00a04059, pp. 411\u2013422. Springer, Heidelberg (2006)"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1007\/3-540-44679-6_34","volume-title":"Computing and Combinatorics","author":"L. Sunil Chandran","year":"2001","unstructured":"Sunil Chandran, L.: A linear time algorithm for enumerating all the maximum and minimal separators of a chordal graph. In: Wang, J. (ed.) COCOON 2001. LNCS, vol.\u00a02108, pp. 308\u2013317. Springer, Heidelberg (2001)"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1137\/S0097539701389154","volume":"32","author":"Z.-Z. Chen","year":"2003","unstructured":"Chen, Z.-Z., Jiang, T., Lin, G.-H.: Computing phylogenetic roots with bounded degrees and errors. SIAM J. Comput.\u00a032, 864\u2013879 (2003)","journal-title":"SIAM J. Comput."},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.jalgor.2004.12.004","volume":"59","author":"Z.-Z. Chen","year":"2006","unstructured":"Chen, Z.-Z., Tsukiji, T.: Computing bounded-degree phylogenetic roots of disconnected graphs. Journal of Algorithms\u00a059, 125\u2013148 (2006)","journal-title":"Journal of Algorithms"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/11604686_35","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M. Dom","year":"2005","unstructured":"Dom, M., Guo, J., H\u00fcffner, F., Niedermeier, R.: Extending the tractability border for closest leaf powers. In: Kratsch, D. (ed.) WG 2005. LNCS, vol.\u00a03787, pp. 397\u2013408. Springer, Heidelberg (2005)"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s00453-005-1180-z","volume":"44","author":"M. Dom","year":"2006","unstructured":"Dom, M., Guo, J., H\u00fcffner, F., Niedermeier, R.: Error compensation in leaf power problems. Algorithmica\u00a044, 363\u2013381 (2006)","journal-title":"Algorithmica"},{"key":"11_CR8","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"Harary, F.: Graph Theory. Addison-Wesley Publishing Company, Reading (1969)"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0020-0190(89)90070-7","volume":"31","author":"C.-W. Ho","year":"1989","unstructured":"Ho, C.-W., Lee, R.C.T.: Counting clique trees and computing perfect elimination schemes in parallel. Infom. Process. Lett.\u00a031, 61\u201368 (1989)","journal-title":"Infom. Process. Lett."},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/11602613_74","volume-title":"Algorithms and Computation","author":"W. Kennedy","year":"2005","unstructured":"Kennedy, W., Lin, G.: 5th Phylogenetic Root Construction for Strictly Chordal Graphs. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 738\u2013747. Springer, Heidelberg (2005)"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Kennedy, W., Lin, G., Yan, G.: Strictly chordal graphs are leaf powers. Journal of Discrete Algorithms\u00a0(to appear)","DOI":"10.1016\/j.jda.2005.06.005"},{"key":"11_CR12","unstructured":"Kong, H., Yan, G.Y.: Algorithm for phylogenetic 5-root problem. Optimization Methods and Software (submitted for publication)"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/3-540-40996-3_46","volume-title":"Algorithms and Computation","author":"G.-H. Lin","year":"2000","unstructured":"Lin, G.-H., Kearney, P.E., Jiang, T.: Phylogenetic k-root and Steiner k-root. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol.\u00a01969, pp. 539\u2013551. Springer, Heidelberg (2000)"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1006\/jagm.1998.9999","volume":"29","author":"P.E. Kearney","year":"1998","unstructured":"Kearney, P.E., Corneil, D.G.: Tree powers. J. of Algorithms\u00a029, 111\u2013131 (1998)","journal-title":"J. of Algorithms"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1006\/jagm.2001.1195","volume":"42","author":"N. Nishimura","year":"2002","unstructured":"Nishimura, N., Ragde, P., Thilikos, D.M.: On graph powers for leaf-labeled trees. J. of Algorithms\u00a042, 69\u2013108 (2002)","journal-title":"J. of Algorithms"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74839-7_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:42:29Z","timestamp":1619520149000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74839-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540748380"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74839-7_11","relation":{},"subject":[]}}