{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:38:00Z","timestamp":1725543480272},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540357537"},{"type":"electronic","value":"9783540357551"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11785293_38","type":"book-chapter","created":{"date-parts":[[2006,6,26]],"date-time":"2006-06-26T05:24:10Z","timestamp":1151299450000},"page":"411-422","source":"Crossref","is-referenced-by-count":7,"title":["Linear-Time Algorithms for Tree Root Problems"],"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"}]},{"given":"Hsueh-I","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"38_CR1","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0012-365X(74)90002-8","volume":"9","author":"P. Buneman","year":"1974","unstructured":"Buneman, P.: Characterization of rigid circuit graphs. Discrete Mathematics\u00a09, 205\u2013212 (1974)","journal-title":"Discrete Mathematics"},{"key":"38_CR2","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF02992776","volume":"25","author":"G.A. Dirac","year":"1961","unstructured":"Dirac, G.A.: On rigid circuit graphs. Abhandlungen aus dem Mathematischen Seminar der Universit\u00e4t Hamburg\u00a025, 71\u201376 (1961)","journal-title":"Abhandlungen aus dem Mathematischen Seminar der Universit\u00e4t Hamburg"},{"key":"38_CR3","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","volume":"16","author":"F. Gavril","year":"1974","unstructured":"Gavril, F.: The intersection graphs of subtrees in trees are exactly chordal graphs. Journal of Combinatorial Theory, Series B\u00a016, 47\u201356 (1974)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"38_CR4","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1080\/00207169908804886","volume":"73","author":"S.K. Gupta","year":"1999","unstructured":"Gupta, S.K., Singh, A.: On tree roots of graphs. International Journal of Computer Mathematics\u00a073, 157\u2013166 (1999)","journal-title":"International Journal of Computer Mathematics"},{"key":"38_CR5","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. Information Processing Letters\u00a031, 61\u201368 (1989)","journal-title":"Information Processing Letters"},{"key":"38_CR6","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1137\/S0097539792224814","volume":"28","author":"W.-L. Hsu","year":"1999","unstructured":"Hsu, W.-L., Ma, T.-H.: Fast and simple algorithms for recognizing chordal comparability graphs and interval graphs. SIAM Journal on Computing\u00a028, 1004\u20131020 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"38_CR7","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. Journal of Algorithms\u00a029, 111\u2013131 (1998)","journal-title":"Journal of Algorithms"},{"key":"38_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0166-218X(00)00336-X","volume":"117","author":"P.S. Kumar","year":"2002","unstructured":"Kumar, P.S., Madhavan, C.E.V.: Clique tree generalization and new subclasses of chordal graphs. Discrete Applied Mathematics\u00a0117, 109\u2013131 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"38_CR9","unstructured":"Lau, L.C.: Bipartite roots of graphs. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 952\u2013961 (2004)"},{"issue":"1","key":"38_CR10","first-page":"83","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 Journal on Computing\u00a018(1), 83\u2013102 (2004)","journal-title":"SIAM Journal on Computing"},{"key":"38_CR11","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1137\/S089548019120016X","volume":"8","author":"Y.L. Lin","year":"1995","unstructured":"Lin, Y.L., Skiena, S.: Algorithms for square roots of graphs. SIAM Journal on Discrete Mathematics\u00a08, 99\u2013118 (1995)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"38_CR12","doi-asserted-by":"publisher","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 Applied Mathematics\u00a054, 81\u201388 (1994)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"38_CR13","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"D. Rose","year":"1976","unstructured":"Rose, D., Tarjan, R., Lueker, G.: Algorithmic aspects of vertex elimination of graph. SIAM Journal on Computing\u00a05(2), 266\u2013283 (1976)","journal-title":"SIAM Journal on Computing"},{"key":"38_CR14","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 squares of a tree. Bell System Technical Journal\u00a039, 641\u2013647 (1960)","journal-title":"Bell System Technical Journal"},{"issue":"3","key":"38_CR15","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"R. Tarjan","year":"1984","unstructured":"Tarjan, R., Yannakakis, M.: Simple linear time algorithms to test chordality of graphs, test acyclicity of hypergraphs and selectively reduce acyclic hypergraphs. SIAM Journal on Computing\u00a013(3), 566\u2013576 (1984)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2013 SWAT 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11785293_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:19:25Z","timestamp":1619507965000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11785293_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540357537","9783540357551"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11785293_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}