Answers are grounded in this paper and cite their sources.
The problem of enumerating all proper cuts of a linear graph arises in several reliability applications and is usually solved by algebraic algorithms. We present a new algorithm based upon implicit enumeration. In addition, we present comparative computational experience which shows that the new algorithm requires significantly less computer time than existing algorithms.
No takes yet. Share an insight, caveat, or question.
Bellmore et al. (1970) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: