循环子集的一个搜索过程
A Search Procedure for Cyclic Subsets
摘要：
本文给出了求图中所有循环子集的集合的一个多项式时间算法。循环子集的概念已经在早期的论文中介绍过了。该算法通过连接V（G）中长度为3的构造块子集来寻找图G中的循环子集。我们证明了该算法的正确性，并给出了算法性能的渐近时间复杂度分析。
英文摘要：
In this paper, a polynomial time algorithm for finding the set of all cyclic subsets in a graph is presented. The concept of cyclic subsets has already been introduced in an earlier paper. The algorithm finds cyclic subsets in a graph G by conjoining building block subsets of length three in V(G). We prove the correctness of this algorithm and present an asymptotic time complexity analysis of the algorithm's performance.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
