{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:41Z","timestamp":1725488981887},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744559"},{"type":"electronic","value":"9783540744566"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74456-6_47","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T07:29:48Z","timestamp":1187076588000},"page":"525-535","source":"Crossref","is-referenced-by-count":9,"title":["On (k,\u2113)-Leaf Powers"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Brandst\u00e4dt","sequence":"first","affiliation":[]},{"given":"Peter","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"47_CR1","first-page":"133","volume":"98","author":"E. Bibelnieks","year":"2006","unstructured":"Bibelnieks, E., Dearing, P.M.: Neighborhood subtree tolerance graphs. Discrete Applied Math.\u00a098, 133\u2013138 (2006)","journal-title":"Discrete Applied Math."},{"key":"47_CR2","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.ipl.2006.01.004","volume":"98","author":"A. Brandst\u00e4dt","year":"2006","unstructured":"Brandst\u00e4dt, A., Le, V.B.: Structure and linear time recognition of 3-leaf powers. Information Processing Letters\u00a098, 133\u2013138 (2006)","journal-title":"Information Processing Letters"},{"key":"47_CR3","unstructured":"Brandst\u00e4dt, A., Le, V.B.: Dieter Rautenbach. Exact leaf powers, manuscript\u00a0 (submitted, 2006)"},{"key":"47_CR4","unstructured":"Brandst\u00e4dt, A., Le Dieter, V.B.: Rautenbach, Distance-hereditary 5-leaf powers, manuscript (submitted, 2006)"},{"key":"47_CR5","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications\u00a03 (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"47_CR6","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Sritharan, R.: Structure and linear time recognition of 4-leaf powers, manuscript (submitted, 2006)","DOI":"10.1016\/j.ipl.2006.01.004"},{"key":"47_CR7","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1137\/0607039","volume":"7","author":"M.W. Broin","year":"1986","unstructured":"Broin, M.W., Lowe, T.J.: A dynamic programming algorithm for covering problems with (greedy) totally balanced constraint matrices. SIAM J. Alg. Disc. Meth.\u00a07, 348\u2013357 (1986)","journal-title":"SIAM J. Alg. Disc. Meth."},{"issue":"B","key":"47_CR8","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/0095-8956(74)90047-1","volume":"1","author":"P. Buneman","year":"1974","unstructured":"Buneman, P.: A note on the metric properties of trees. J. Combin. Th.\u00a01(B), 48\u201350 (1974)","journal-title":"J. Combin. Th."},{"key":"47_CR9","unstructured":"Chang, M.-S., Ko, T.: The 3-Steiner Root Problem. In: Proceedings WG 2007. LNCS, manuscript, as extended abstract (to appear, 2007)"},{"key":"47_CR10","first-page":"23","volume":"24 B","author":"E. Dahlhaus","year":"1987","unstructured":"Dahlhaus, E., Duchet, P.: On strongly chordal graphs. Ars Combinatoria\u00a024 B, 23\u201330 (1987)","journal-title":"Ars Combinatoria"},{"key":"47_CR11","unstructured":"Dom, M., Guo, J., H\u00fcffner, F., Niedermeier, R.: Error compensation in leaf root problems. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 363\u2013381. Springer, Heidelberg (2004), Algorithmica 44(4), 363\u2013381(2006)"},{"key":"47_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, Springer, Heidelberg (2005)"},{"issue":"B","key":"47_CR13","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0095-8956(79)90069-8","volume":"27","author":"E. Howorka","year":"1979","unstructured":"Howorka, E.: On metric properties of certain clique graphs. J. Combin. Th.\u00a027(B), 67\u201374 (1979)","journal-title":"J. Combin. Th."},{"key":"47_CR14","unstructured":"Kennedy, W.: Strictly chordal graphs and phylogenetic roots, Master Thesis, University of Alberta (2005)"},{"key":"47_CR15","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.: 5-th phylogenetic root construction for strictly chordal graphs, extended abstract. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 738\u2013747. Springer, Heidelberg (2005)"},{"key":"47_CR16","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/j.jda.2005.06.005","volume":"4","author":"W. Kennedy","year":"2006","unstructured":"Kennedy, W., Lin, G., Yan, G.: Strictly chordal graphs are leaf powers. J. Discrete Algorithms\u00a04, 511\u2013525 (2006)","journal-title":"J. Discrete Algorithms"},{"key":"47_CR17","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., Jiang, T., Kearney, P.E.: Phylogenetic k-root and Steiner k-root, Extended abstract. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol.\u00a01969, pp. 539\u2013551. Springer, Heidelberg (2000)"},{"key":"47_CR18","unstructured":"Lubiw, A.: \u0393-free matrices, Master Thesis, Dept. of Combinatorics and Optimization, University of Waterloo, Canada (1982)"},{"key":"47_CR19","doi-asserted-by":"crossref","unstructured":"McKee, T.A., McMorris, F.R.: Topics in Intersection Graph Theory. SIAM Monographs on Discrete Mathematics and Applications\u00a02 (1999)","DOI":"10.1137\/1.9780898719802"},{"key":"47_CR20","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. Algorithms\u00a042, 69\u2013108 (2002)","journal-title":"J. Algorithms"},{"issue":"13","key":"47_CR21","doi-asserted-by":"publisher","first-page":"1456","DOI":"10.1016\/j.disc.2006.03.030","volume":"306","author":"D. Rautenbach","year":"2006","unstructured":"Rautenbach, D.: Some remarks about leaf roots. Discrete Math.\u00a0306(13), 1456\u20131461 (2006)","journal-title":"Discrete Math."},{"key":"47_CR22","first-page":"147","volume":"34","author":"A. Raychaudhuri","year":"1992","unstructured":"Raychaudhuri, A.: On powers of strongly chordal and circular arc graphs. Ars Combinatoria\u00a034, 147\u2013160 (1992)","journal-title":"Ars Combinatoria"},{"key":"47_CR23","doi-asserted-by":"crossref","unstructured":"Spinrad, J.P.: Efficient Graph Representations, Fields Institute Monographs, American Mathematical Society, Providence, Rhode Island (2003)","DOI":"10.1090\/fim\/019"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74456-6_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T01:12:24Z","timestamp":1558487544000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74456-6_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540744559","9783540744566"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74456-6_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}