Certain properties of a shortest chain subject to several side constraints are established. Based on these an implicit enumeration algorithm, that is, a generalization of the one given by Dijkstra for the case without any side constraint, is presented. Validation of the algorithm and an illustrative example are included.

No abstract

No abstract

No abstract

disulfide, and 10 µ\ of methyl iodide. The mixture was shaken for 5 min at room temperature and centrifuged. About 3-4 µ of the organic phase were injected into the gas chromatograph.