{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:50:46Z","timestamp":1742914246197,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031556005"},{"type":"electronic","value":"9783031556012"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-55601-2_10","type":"book-chapter","created":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T19:02:17Z","timestamp":1709665337000},"page":"147-161","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Induced Tree Covering and\u00a0the\u00a0Generalized Yutsis Property"],"prefix":"10.1007","author":[{"given":"Lu\u00eds","family":"Cunha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriel","family":"Duarte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F\u00e1bio","family":"Protti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Loana","family":"Nogueira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5320-9209","authenticated-orcid":false,"given":"U\u00e9verton","family":"Souza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,6]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Aldred, R.E., Van Dyck, D., Brinkmann, G., Fack, V., McKay, B.D.: Graph structural properties of non-Yutsis graphs allowing fast recognition. Discret. Appl. Math., 157(2), 377\u2013386 (2009)","DOI":"10.1016\/j.dam.2008.03.020"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"10","DOI":"10.13001\/1081-3810.1424","volume":"22","author":"F Barioli","year":"2011","unstructured":"Barioli, F., Fallat, S., Mitchell, L., Narayan, S.: Minimum semidefinite rank of outerplanar graphs and the tree cover number. Electron. J. Linear Algebra 22, 10\u201321 (2011)","journal-title":"Electron. J. Linear Algebra"},{"key":"10_CR3","unstructured":"Lawrence Christian Biedenharn and James D Louck. The Racah-Wigner algebra in quantum theory. Addison-Wesley (1981)"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Bozeman, C., Catral, M., Cook, B., Gonz\u00e1lez, O., Reinhart, C.: On the tree cover number of a graph. Involve, a J. Math. 10(5), 767\u2013779 (2017)","DOI":"10.2140\/involve.2017.10.767"},{"issue":"2","key":"10_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst. 33(2), 125\u2013150 (2000)","journal-title":"Theory Comput. Syst."},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I. recognizable sets of finite graphs. Inform. Comput. 85(1), 12\u201375 (1990)","DOI":"10.1016\/0890-5401(90)90043-H"},{"issue":"1\u20133","key":"10_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","volume":"101","author":"B Courcelle","year":"2000","unstructured":"Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discret. Appl. Math. 101(1\u20133), 77\u2013114 (2000)","journal-title":"Discret. Appl. Math."},{"key":"10_CR8","doi-asserted-by":"publisher","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3","DOI":"10.1007\/978-3-319-21275-3"},{"key":"10_CR9","unstructured":"Duarte, G., Oliveira, M.D.O., Souza, U.S.: Co-degeneracy and co-treewidth: using the complement to solve dense instances. In: 46th International Symposium on Mathematical Foundations of Computer Science, MFCS, volume 202 of LIPIcs, pp. 42:1\u201342:17 (2021)"},{"issue":"5","key":"10_CR10","doi-asserted-by":"publisher","first-page":"1421","DOI":"10.1007\/s00453-020-00789-1","volume":"83","author":"GL Durate","year":"2021","unstructured":"Durate, G.L., et al.: Computing the largest bond and the maximum connected cut of a graph. Algorithmica 83(5), 1421\u20131458 (2021). https:\/\/doi.org\/10.1007\/s00453-020-00789-1","journal-title":"Algorithmica"},{"key":"10_CR11","unstructured":"Duarte, G.L., Lokshtanov, D., Pedrosa, L.L., Schouery, R., Souza, U.S.: Computing the largest bond of a graph. In 14th International Symposium on Parameterized and Exact Computation, IPEC, volume 148 of LIPIcs, pp. 12:1\u201312:15 (2019)"},{"key":"10_CR12","doi-asserted-by":"publisher","unstructured":"Duarte, G.L., Souza, U.S.: On the minimum cycle cover problem on graphs with bounded co-degeneracy. In: 48th International Workshop on Graph-Theoretic Concepts in Computer Science, WG, vol. 13453 of LNCS, pp. 187\u2013200 (2022). https:\/\/doi.org\/10.1007\/978-3-031-15914-5_14","DOI":"10.1007\/978-3-031-15914-5_14"},{"issue":"11","key":"10_CR13","doi-asserted-by":"publisher","first-page":"1506","DOI":"10.1016\/j.disc.2005.11.088","volume":"307","author":"DV Dyck","year":"2007","unstructured":"Dyck, D.V., Fack, V.: On the reduction of Yutsis graphs. Discret. Math. 307(11), 1506\u20131515 (2007)","journal-title":"Discret. Math."},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"79","DOI":"10.13001\/1081-3810.1506","volume":"23","author":"J Ekstrand","year":"2012","unstructured":"Ekstrand, J., Erickson, C., Hay, D., Hogben, L., Roat, J.: Note on positive semidefinite maximum nullity and positive semidefinite zero forcing number of partial 2-trees. Electron. J. Linear Algebra 23, 79\u201387 (2012)","journal-title":"Electron. J. Linear Algebra"},{"key":"10_CR15","unstructured":"Eto, H., Hanaka, T., Kobayashi, Y., Kobayashi, Y.: Parameterized algorithms for maximum cut with connectivity constraints. In: 14th International Symposium on Parameterized and Exact Computation, IPEC, vol. 148 of LIPIcs, pp. 13:1\u201313:15 (2019)"},{"issue":"5","key":"10_CR16","doi-asserted-by":"publisher","first-page":"1941","DOI":"10.1137\/080742270","volume":"39","author":"F Fomin","year":"2010","unstructured":"Fomin, F., Golovach, P., Lokshtanov, D., Saurabh, S.: Intractability of clique-width parameterizations. SIAM J. Comput. 39(5), 1941\u20131956 (2010)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10_CR17","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1137\/0205049","volume":"5","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Tarjan, R.E.: The planar hamiltonian circuit problem is NP-complete. SIAM J. Comput. 5(4), 704\u2013714 (1976)","journal-title":"SIAM J. Comput."},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Godsil, C., Royle, G.F.: Algebraic Graph Theory. Graduate texts in mathematics. Springer (2001)","DOI":"10.1007\/978-1-4613-0163-9"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/3-540-46784-X_14","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"MC Golumbic","year":"1999","unstructured":"Golumbic, M.C., Rotics, U.: On the clique\u2014width of perfect graph classes. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds.) WG 1999. LNCS, vol. 1665, pp. 135\u2013147. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-46784-X_14"},{"issue":"2","key":"10_CR20","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s00453-012-9740-5","volume":"69","author":"MR Khani","year":"2013","unstructured":"Khani, M.R., Salavatipour, M.R.: Improved approximation algorithms for the min-max tree cover and bounded tree cover problems. Algorithmica 69(2), 443\u2013460 (2013). https:\/\/doi.org\/10.1007\/s00453-012-9740-5","journal-title":"Algorithmica"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Lokshtanov, D., Marx, D., Saurabh, S.: Known algorithms on graphs of bounded treewidth are probably optimal. ACM Trans. Algorithms, 14(2) (2018)","DOI":"10.1145\/3170442"},{"issue":"3","key":"10_CR22","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1137\/16M1104834","volume":"47","author":"D Lokshtanov","year":"2018","unstructured":"Lokshtanov, D., Marx, D., Saurabh, S.: Slightly superexponential parameterized problems. SIAM J. Comput. 47(3), 675\u2013702 (2018)","journal-title":"SIAM J. Comput."},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Oum, S.I., Seymour, P.: Approximating clique-width and branch-width. J. Comb. Theory, B, 96(4), 514\u2013528 (2006)","DOI":"10.1016\/j.jctb.2005.10.006"},{"key":"10_CR24","volume-title":"Matroid theory","author":"JG Oxley","year":"2006","unstructured":"Oxley, J.G.: Matroid theory, vol. 3. Oxford University Press, USA (2006)"},{"issue":"2","key":"10_CR25","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1016\/0304-3975(94)90185-6","volume":"131","author":"C Picouleau","year":"1994","unstructured":"Picouleau, C.: Complexity of the hamiltonian cycle in regular graph problem. Theoret. Comput. Sci. 131(2), 463\u2013473 (1994)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10_CR26","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/S0021-9800(69)80033-5","volume":"6","author":"DJA Welsh","year":"1969","unstructured":"Welsh, D.J.A.: Euler and bipartite matroids. J. Combinatorial Theory 6(4), 375\u2013377 (1969)","journal-title":"J. Combinatorial Theory"},{"key":"10_CR27","unstructured":"Yutsis, A.P., Vanagas, V.V., Levinson, I.B.: Mathematical apparatus of the theory of angular momentum. Israel program for scientific translations (1962)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2024: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-55601-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T19:04:27Z","timestamp":1709665467000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-55601-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031556005","9783031556012"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-55601-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"6 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Puerto Varas","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chile","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 March 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 March 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/latin2024.cmm.uchile.cl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"92","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}