A Search Procedure for Cyclic Subsets
Data Structures and Algorithms
2014-01-07 v1 Combinatorics
Abstract
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.
Keywords
Cite
@article{arxiv.1401.0906,
title = {A Search Procedure for Cyclic Subsets},
author = {P. Clarke},
journal= {arXiv preprint arXiv:1401.0906},
year = {2014}
}
Comments
10 pages, 2 figures