Abstract

AbstractAn efficient program is developed for selecting subminimal cycle bases of graphs. In this program an expansion process is used and independent cycles of minimal lengths are generated. The independence is provided by restricting the increase of Betti number by unity in each step of the process.

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 call

Disclaimer: 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.