| Generation of vertex and edge cutsets (1992) | |||||||||||
Abstract | |||||||||||
| An algorithm is proposed to obtain basic minimal paths from basic minimal path tree for a network having a single source vertex and a single sink vertex. This does not require generation of all minimal paths. Using the paths thus obtained. A simple method is suggested to obtain all minimal vertex cutsets of any graph using OR and AND logic expressions. These paths can also be used to obtain all minimal edge cutsets which is advantageous for sparse graphs. | |||||||||||
Publication details | |||||||||||
| |||||||||||