Abstract
In this paper, the family of Maximal Reducible Flowgraphs (MRFs) is recursively defined, based on a decomposition theorem. A one-to-one association between MRFs and extended binary trees allows to deduce some numerical properties of the family. Hamiltonian problems, testing isomorphism and finding a minimum cardinality feedback arc set are efficiently solved for MRFs. The results concerning hamiltonian paths and cycles also hold for reducible flowgraphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.