scientific article; zbMATH DE number 3908451

From MaRDI portal
Publication:3686729





[For the entire collection see Zbl 0564.00004.] Sequential programs are modelled by 2 directed trees which describe respectively the True and False outcomes of the program predicates. It is shown to be a special case of Edmonds' disjoint branching theorem and it gives a new proof and algorithm for this special case.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3686729)