Solving problems for maximal reducible flowgraphs Original Research Article

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.