Abstract
An improvement is presented for the existing minimal cycle basis selection algorithms increasing their efficiency. This consists of reducing the number of cycles to be considered as candidates for being the elements of a minimal cycle basis and makes practical use of the Greedy algorithm feasible. A modification is also included to form suboptimal‐minimal cycle bases in place of minimal bases. An efficient algorithm is developed to form suboptimal cycle bases of graphs, in which the Greedy algorithm is applied twice. First a suboptimal minimal cycle basis is formed, and then ignoring the minimality, a basis with elements having smaller overlaps is selected.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
