{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:01:51Z","timestamp":1725494511033},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540676904"},{"type":"electronic","value":"9783540449850"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44985-x_12","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T20:17:33Z","timestamp":1194985053000},"page":"125-138","source":"Crossref","is-referenced-by-count":3,"title":["On Graph Powers for Leaf-Labeled Trees"],"prefix":"10.1007","author":[{"given":"Naomi","family":"Nishimura","sequence":"first","affiliation":[]},{"given":"Prabhakar","family":"Ragde","sequence":"additional","affiliation":[]},{"given":"Dimitrios M.","family":"Thilikos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,3,15]]},"reference":[{"key":"12_CR1","unstructured":"J.-P. Barth\u00e9lemy and A. Gu\u00e9noche. Trees and Proximity Representations. John Wiley and Sons, 1991."},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1006\/jagm.1998.9999","volume":"29","author":"D. G. Corneil","year":"1998","unstructured":"D. G. Corneil and P. Kearney. Tree powers. Journal of Algorithms, 29:111\u2013131, 1998.","journal-title":"Journal of Algorithms"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1137\/0201013","volume":"1","author":"R. Gavril","year":"1972","unstructured":"R. Gavril. Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set for chordal graphs. SIAM Journal on Computing, 1:180\u2013187, 1972.","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"12_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00009268","volume":"24","author":"M. R. Henzinger","year":"1999","unstructured":"M. R. Henzinger, V. King, and T. Warnow. Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology. Algorithmica, 24(1):1\u201313, 1999.","journal-title":"Algorithmica"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"D. H. Huson, K. A. Smith, and T. Warnow. Estimating large distances in phylogenetic reconstruction. Algorithm Engineering, pages 270\u2013285, 1999.","DOI":"10.1007\/3-540-48318-7_22"},{"key":"12_CR6","unstructured":"J. Kim and T. Warnow. Tutorial on phylogenetic tree estimation. manuscript, Department of Ecology and Evolutionary Biology, Yale University, \n                    http:\/\/ismb99\n                    \n                  .gmd.de\/TUTORIALS\/Kim\/4KimTutorial.ps, 1999."},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"N. Linial","year":"1992","unstructured":"N. Linial. Locality in distributed graph algorithms. SIAM Journal on Computing, 21:193\u2013201, 1992.","journal-title":"SIAM Journal on Computing"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0166-218X(94)00023-9","volume":"54","author":"R. Motwani","year":"1994","unstructured":"R. Motwani and M. Sudan. Computing roots of graphs is hard. Discrete Applied Mathematics, 54:81\u201388, 1994.","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"12_CR9","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"D. J. Rose","year":"1976","unstructured":"D. J. Rose, R. E. Tarjan, and G. S. Lueker. Algorithmic aspects of vertex elimination on graphs. SIAM Journal on Computing, 5(2):266\u2013283, 1976.","journal-title":"SIAM Journal on Computing"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"R. E. Tarjan","year":"1984","unstructured":"R. E. Tarjan and M. Yannakakis. Simple linear-time algorihtms to test chodality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM Journal on Computing, 13:566\u2013579, 1984.","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44985-X_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T06:19:27Z","timestamp":1551075567000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44985-X_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540676904","9783540449850"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-44985-x_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}