{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T14:31:49Z","timestamp":1791124309861,"version":"4.1.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2010,9,14]],"date-time":"2010-09-14T00:00:00Z","timestamp":1284422400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1007\/s00453-010-9442-9","type":"journal-article","created":{"date-parts":[[2010,9,13]],"date-time":"2010-09-13T17:41:41Z","timestamp":1284399701000},"page":"38-53","source":"Crossref","is-referenced-by-count":19,"title":["Complexity of Finding Graph Roots with\u00a0Girth Conditions"],"prefix":"10.1007","volume":"62","author":[{"given":"Babak","family":"Farzad","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lap Chi","family":"Lau","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Van Bang","family":"Le","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nguyen Ngoc","family":"Tuy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,9,14]]},"reference":[{"key":"9442_CR1","first-page":"41","volume":"144","author":"G. Agnarsson","year":"2000","unstructured":"Agnarsson, G., Greenlaw, R., Halld\u00f3rsson, M.M.: On powers of chordal graphs and their colorings. Congressus Numer. 144, 41\u201365 (2000)","journal-title":"Congressus Numer."},{"key":"9442_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0963548301004965","volume":"11","author":"N. Alon","year":"2002","unstructured":"Alon, N., Mohar, B.: The chromatic number of graph powers. Comb. Probab. Comput. 11, 1\u201310 (2002)","journal-title":"Comb. Probab. Comput."},{"key":"9442_CR3","unstructured":"Brandst\u00e4dt, A., Le, V.B., Sritharan, R.: Structure and linear time recognition of 4-leaf powers. ACM Trans. Algorithms 5 (2008), Article No.\u00a011"},{"key":"9442_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/11785293_38","volume-title":"Proceedings of the 10th Scandinavian Workshop on Algorithm Theory (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: Proceedings of the 10th Scandinavian Workshop on Algorithm Theory (SWAT 2006). Lecture Notes in Computer Science, vol. 4059, pp. 411\u2013422. Springer, Berlin (2006)"},{"key":"9442_CR5","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. J. Symbol. Comput. 9, 251\u2013280 (1990)","journal-title":"J. Symbol. Comput."},{"key":"9442_CR6","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1002\/jgt.20273","volume":"57","author":"D.W. Cranston","year":"2007","unstructured":"Cranston, D.W., Kim, S.-J.: List-coloring the square of a subcubic graph. J. Graph Theory 57, 65\u201387 (2007)","journal-title":"J. Graph Theory"},{"key":"9442_CR7","first-page":"23","volume":"24","author":"E. Dahlhaus","year":"1987","unstructured":"Dahlhaus, E., Duchet, P.: On strongly chordal graphs. Ars Combin. B 24, 23\u201330 (1987)","journal-title":"Ars Combin. B"},{"key":"9442_CR8","volume-title":"Computers and Intractability\u2014A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability\u2014A Guide to the Theory of NP-Completeness. Freeman, New York (1979). Twenty-third printing 2002"},{"key":"9442_CR9","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)"},{"issue":"11","key":"9442_CR10","doi-asserted-by":"crossref","first-page":"3553","DOI":"10.1016\/j.disc.2007.12.100","volume":"309","author":"F. Havet","year":"2009","unstructured":"Havet, F.: Choosability of the square of planar subcubic graphs with large girth. Discrete Math. 309(11), 3553\u20133563 (2009)","journal-title":"Discrete Math."},{"key":"9442_CR11","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1137\/0406030","volume":"6","author":"J.D. Horton","year":"1993","unstructured":"Horton, J.D., Kilakos, K.: Minimum edge dominating sets. SIAM J. Discrete Math. 6, 375\u2013387 (1993)","journal-title":"SIAM J. Discrete Math."},{"key":"9442_CR12","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1137\/0207033","volume":"7","author":"A. Itai","year":"1978","unstructured":"Itai, A., Rodeh, M.: Finding a minimum circuit in a graph. SIAM J. Comput. 7, 413\u2013423 (1978)","journal-title":"SIAM J. Comput."},{"key":"9442_CR13","doi-asserted-by":"crossref","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. Algorithms 29, 111\u2013131 (1998)","journal-title":"J. Algorithms"},{"key":"9442_CR14","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1145\/1150334.1150337","volume":"2","author":"L.C. Lau","year":"2006","unstructured":"Lau, L.C.: Bipartite roots of graphs. ACM Trans. Algorithms 2, 178\u2013208 (2006)","journal-title":"ACM Trans. Algorithms"},{"key":"9442_CR15","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1137\/S0895480103425930","volume":"18","author":"L.C. Lau","year":"2004","unstructured":"Lau, L.C., Corneil, D.G.: Recognizing powers of proper interval, split and chordal graphs. SIAM J. Discrete Math. 18, 83\u2013102 (2004)","journal-title":"SIAM J. Discrete Math."},{"key":"9442_CR16","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1137\/S089548019120016X","volume":"8","author":"Y.-L. Lin","year":"1995","unstructured":"Lin, Y.-L., Skiena, S.S.: Algorithms for square roots of graphs. SIAM J. Discrete Math. 8, 99\u2013118 (1995)","journal-title":"SIAM J. Discrete Math."},{"key":"9442_CR17","unstructured":"Lubiw, A.: \u0393-free matrices. Master Thesis, Dept. of Combinatorics and Optimization, University of Waterloo, Canada (1982)"},{"key":"9442_CR18","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0166-218X(94)00023-9","volume":"54","author":"R. Motwani","year":"1994","unstructured":"Motwani, R., Sudan, M.: Computing roots of graphs is hard. Discrete Appl. Math. 54, 81\u201388 (1994)","journal-title":"Discrete Appl. Math."},{"key":"9442_CR19","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/S0021-9800(67)80030-9","volume":"2","author":"A. Mukhopadhyay","year":"1967","unstructured":"Mukhopadhyay, A.: The square root of a graph. J. Combin. Theory 2, 290\u2013295 (1967)","journal-title":"J. Combin. Theory"},{"key":"9442_CR20","first-page":"147","volume":"34","author":"A. Raychaudhuri","year":"1992","unstructured":"Raychaudhuri, A.: On powers of strongly chordal and circular arc graphs. Ars Combin. 34, 147\u2013160 (1992)","journal-title":"Ars Combin."},{"key":"9442_CR21","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1002\/j.1538-7305.1960.tb03936.x","volume":"39","author":"I.C. Ross","year":"1960","unstructured":"Ross, I.C., Harary, F.: The square of a tree. Bell Syst. Tech. J. 39, 641\u2013647 (1960)","journal-title":"Bell Syst. Tech. J."},{"key":"9442_CR22","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1137\/0206036","volume":"6","author":"S. Tsukiyama","year":"1977","unstructured":"Tsukiyama, S., Ide, M., Ariyoshi, H., Shirakawa, I.: A new algorithm for generating all the maximal independent sets. SIAM J. Comput. 6, 505\u2013517 (1977)","journal-title":"SIAM J. Comput."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9442-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-010-9442-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9442-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:06Z","timestamp":1559137506000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-010-9442-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,14]]},"references-count":22,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["9442"],"URL":"https:\/\/doi.org\/10.1007\/s00453-010-9442-9","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9,14]]}}}