Decomposition algorithms for minimal cut problems

Suleyman Tufekci

Naval Research Logistics Quarterly, 1981, vol. 28, issue 3, 431-445

Abstract: Consider a network G(N. A) with n nodes, where node 1 designates its source node and node n designates its sink node. The cuts (Zi, =), i= 1…, n ‐ 1 are called one‐node cuts if 1 ϵ Zi,. n q Zi, Z1‐− {1}, Zi ϵ Zi+1 and Zi and Zi+l differ by only one node. It is shown that these one‐node cuts decompose G into 1 m n/2 subnetworks with known minimal cuts. Under certain circumstances, the proposed one‐node decomposition can produce a minimal cut for G in 0(n2 ) machine operations. It is also shown that, under certain conditions, one‐node cuts produce no decomposition. An alternative procedure is also introduced to overcome this situation. It is shown that this alternative procedure has the computational complexity of 0(n3).

Date: 1981
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800280308

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:28:y:1981:i:3:p:431-445

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().