{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T09:18:21Z","timestamp":1765531101689,"version":"3.48.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T00:00:00Z","timestamp":1758672000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T00:00:00Z","timestamp":1758672000000},"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":["Acta Informatica"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s00236-025-00506-x","type":"journal-article","created":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T04:36:13Z","timestamp":1758688573000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Spanning cactus and spanning cactus extension of outerplanar graphs"],"prefix":"10.1007","volume":"62","author":[{"given":"Chinmay","family":"Debnath","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7001-9423","authenticated-orcid":false,"given":"Alak Kumar","family":"Datta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,9,24]]},"reference":[{"issue":"6","key":"506_CR1","doi-asserted-by":"publisher","first-page":"1142","DOI":"10.1137\/0222068","volume":"22","author":"J Cai","year":"1993","unstructured":"Cai, J., Han, X., Tarjan, R.E.: An o(m log n)-time algorithm for the maximal planar subgraph problem. SIAM J. Comput. 22(6), 1142\u20131162 (1993)","journal-title":"SIAM J. Comput."},{"key":"506_CR2","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0012-365X(94)00326-E","volume":"149","author":"R Cimikowski","year":"1996","unstructured":"Cimikowski, R., Coppersmith, D.: The sizes of maximal planar, outerplanar, and bipartite planar subgraphs. Discret. Math. 149, 303\u2013309 (1996)","journal-title":"Discret. Math."},{"issue":"11","key":"506_CR3","doi-asserted-by":"publisher","first-page":"828","DOI":"10.1016\/j.ipl.2015.06.009","volume":"115","author":"AK Datta","year":"2015","unstructured":"Datta, A.K.: Approximate spanning cactus. Inf. Process. Letter. 115(11), 828\u2013832 (2015)","journal-title":"Inf. Process. Letter."},{"key":"506_CR4","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.dam.2017.08.020","volume":"233","author":"AK Datta","year":"2017","unstructured":"Datta, A.K., Debnath, C.: Spanning cactus: complexity and extensions. Discret. Appl. Math. 233, 19\u201328 (2017)","journal-title":"Discret. Appl. Math."},{"key":"506_CR5","first-page":"290","volume-title":"Stud. Discret. Math.","author":"EA Dinits","year":"1976","unstructured":"Dinits, E.A., Karzanov, A.V., Lomonosov, M.V.: On the structure of a family of minimal weighted cuts in graphs. In: Fridman, A.A. (ed.) Stud. Discret. Math., pp. 290\u2013306. Nauka, Moskva (1976)"},{"key":"506_CR6","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1006\/jagm.1999.1039","volume":"33","author":"L Fleischer","year":"1999","unstructured":"Fleischer, L.: Building chain and cactus representations of all minimum cuts from hao-orlin in the same asymptotic run time. J. Algorithm. 33, 51\u201372 (1999)","journal-title":"J. Algorithm."},{"key":"506_CR7","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0012-365X(00)00397-6","volume":"234","author":"W Goddard","year":"2001","unstructured":"Goddard, W., Henning, M.A.: Pancyclicity of the prism. Discret. Math. 234, 139\u2013142 (2001)","journal-title":"Discret. Math."},{"key":"506_CR8","volume-title":"The traveling salesman problem and its variations","author":"G Gutin","year":"2002","unstructured":"Gutin, G., Punnen, A.P.: The traveling salesman problem and its variations. Kluwer, Dordrecht (2002)"},{"key":"506_CR9","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/0095-8956(79)90041-8","volume":"26","author":"AM Hobbs","year":"1979","unstructured":"Hobbs, A.M.: Hamiltonian squares of cacti. J. Comb. Theory, Series B 26, 50\u201365 (1979)","journal-title":"J. Comb. Theory, Series B"},{"key":"506_CR10","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.dam.2012.08.006","volume":"161","author":"SN Kabadi","year":"2013","unstructured":"Kabadi, S.N., Punnen, A.P.: Spanning cactus of a graph: existence, extension, optimization, and approximation. Discret. Appl. Math. 161, 167\u2013175 (2013)","journal-title":"Discret. Appl. Math."},{"key":"506_CR11","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"JB Kruskal","year":"1956","unstructured":"Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. American Math. Soc. 7, 48\u201350 (1956)","journal-title":"Proc. American Math. Soc."},{"key":"506_CR12","doi-asserted-by":"crossref","unstructured":"Harary, F.: Graph Theory, Addison-Wesley Publishing Company, (1969)","DOI":"10.21236\/AD0705364"},{"key":"506_CR13","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E Lawler","year":"1976","unstructured":"Lawler, E.: Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York (1976)"},{"key":"506_CR14","first-page":"25","volume-title":"A wireless token ring protocol for intelligent transportation system","author":"D Lee","year":"2001","unstructured":"Lee, D., Attias, R., Puri, A., Sengupta, R., Tripakis, S., Varaiya, P.: A wireless token ring protocol for intelligent transportation system, pp. 25\u201329. IEEE Intelligent Transportation Systems, California, USA (2001)"},{"key":"506_CR15","doi-asserted-by":"crossref","unstructured":"Maheshwari, A., Zeh, N.: External memory algorithms for outerplanar graphs, Proc. of the 10th International Symposium on Algorithms and Computation, V. 1741, Lecture Notes in Computer Science, pp. 307-316, (1999)","DOI":"10.1007\/3-540-46632-0_31"},{"issue":"5","key":"506_CR16","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0020-0190(79)90075-9","volume":"9","author":"SL Mitchell","year":"1979","unstructured":"Mitchell, S.L.: Linear algorithms to recognize outerplanar and maximal outerplanar graphs. Inf. Process. Lett. 9(5), 229\u2013232 (1979)","journal-title":"Inf. Process. Lett."},{"key":"506_CR17","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.dam.2004.08.006","volume":"146","author":"A Palbom","year":"2005","unstructured":"Palbom, A.: Complexity of the directed spanning cactus problem. Discret. Appl. Math. 146, 81\u201391 (2005)","journal-title":"Discret. Appl. Math."},{"key":"506_CR18","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1089\/cmb.2010.0252","volume":"18","author":"B Paten","year":"2011","unstructured":"Paten, B., Diekhans, M., Earl, D., John, J.S.T., Ma, J., Suh, B., Haussler, D.: Cactus graphs for genome comparisons. J. Comput. Biol. 18, 469\u2013481 (2011)","journal-title":"J. Comput. Biol."},{"issue":"6","key":"506_CR19","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36(6), 1389\u20131401 (1957)","journal-title":"Bell Syst. Tech. J."},{"key":"506_CR20","doi-asserted-by":"crossref","unstructured":"Zmazek, B., Zerovnik, J.I.: Estimating the traffic on weighted cactus network in linear time, International Conference on Information Visualisation, London, UK, pp.536-541 (July 2005)","DOI":"10.1109\/IV.2005.48"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-025-00506-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00236-025-00506-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-025-00506-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T09:14:35Z","timestamp":1765530875000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00236-025-00506-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,24]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["506"],"URL":"https:\/\/doi.org\/10.1007\/s00236-025-00506-x","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"type":"print","value":"0001-5903"},{"type":"electronic","value":"1432-0525"}],"subject":[],"published":{"date-parts":[[2025,9,24]]},"assertion":[{"value":"16 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 September 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"37"}}