A novel and efficient algorithm for scanning all minimal cutsets of a graph

Simple item page
dc.creatorSharafat, Ahmad R.
dc.creatorMa'rouzi, Omid R.
dc.date2002-11-27
dc.date.accessioned2026-07-07T04:53:21Z
dc.date.available2026-07-07T04:53:21Z
dc.descriptionWe propose a novel algorithm for enumerating and listing all minimal cutsets of a given graph. It is known that this problem is NP-hard. We use connectivity properties of a given graph to develop an algorithm with reduced complexity for finding all its cutsets. We use breadth first search (BFS) method in conjunction with edge contraction to develop the algorithm. We introduce the concepts of a pivot vertex and absorbable clusters and use them to develop an enhanced recursive contraction algorithm. The complexity of the proposed algorithm is proportionate to the number of cutsets. We present simulation results to compare the performance of our proposed algorithm with those of existing methods.
dc.description15 pages, 15 figures, submitted to the Journal of the ACM
dc.identifierhttps://arxiv.org/abs/math/0211436
dc.identifierhttp://arxiv.org/abs/math/0211436
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/65816
dc.subjectCombinatorics
dc.subject05C85
dc.titleA novel and efficient algorithm for scanning all minimal cutsets of a graph
dc.typetext

Files

Collections

arXiv