Spanning cactus and spanning cactus extension of outerplanar graphs

IF 0.5 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Acta Informatica Pub Date : 2025-09-24 DOI:10.1007/s00236-025-00506-x

Chinmay Debnath, Alak Kumar Datta

引用次数: 0

Abstract

Minimum spanning cactus and minimum spanning cactus extension problems on outerplanar graphs are studied. Linear algorithms are presented for both problems on outerplanar graphs. A partitioning technique is introduced that partitions a maximal biconnected outerplanar graph into a set of maximal star-outerplanar subgraphs and some chords. Further, the minimum spanning cacti of these star-outerplanar subgraphs can be computed and suitably combined to get a minimum spanning cactus and a minimum spanning cactus extension of a given outerplanar graph.

Abstract Image

查看原文本刊更多论文

外平面图的生成仙人掌和生成仙人掌的扩展

研究了外平面图上的最小生成仙人掌和最小生成仙人掌的可拓问题。给出了这两个问题在外平面图上的线性算法。介绍了一种将极大双连通外平面图划分为极大星-外平面子图集和若干弦的划分技术。此外，还可以计算这些星-外平面子图的最小生成仙人掌，并将其适当地组合在一起，得到给定外平面图的最小生成仙人掌和最小生成仙人掌扩展。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Acta Informatica 工程技术-计算机：信息系统

CiteScore

2.40

自引率

16.70%

发文量

审稿时长

>12 weeks

期刊介绍： Acta Informatica provides international dissemination of articles on formal methods for the design and analysis of programs, computing systems and information structures, as well as related fields of Theoretical Computer Science such as Automata Theory, Logic in Computer Science, and Algorithmics. Topics of interest include: • semantics of programming languages • models and modeling languages for concurrent, distributed, reactive and mobile systems • models and modeling languages for timed, hybrid and probabilistic systems • specification, program analysis and verification • model checking and theorem proving • modal, temporal, first- and higher-order logics, and their variants • constraint logic, SAT/SMT-solving techniques • theoretical aspects of databases, semi-structured data and finite model theory • theoretical aspects of artificial intelligence, knowledge representation, description logic • automata theory, formal languages, term and graph rewriting • game-based models, synthesis • type theory, typed calculi • algebraic, coalgebraic and categorical methods • formal aspects of performance, dependability and reliability analysis • foundations of information and network security • parallel, distributed and randomized algorithms • design and analysis of algorithms • foundations of network and communication protocols.