id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
ijassa-744	Forghani-elahabad, Majid; Mahdavi-Amiri, Nezam	An Algorithm to Search for All Minimal Cuts in a Flow Network	2021	10	.pdf	application/pdf	5939	419	83	Let i = 3, k = 3, T = {4, t}, A = D3 = C3 = {e14, e24, e34, e3t}, S = {s, 1, 2, 3}, P = {C0, C1, C2, C3}, N3 = {t} and transfer is made to Step 1. Let i = 2, k = 6, T = {2, 3, t}, A = D2 = C6 = {es2, e12, e24, e34, e4t}, S = {s, 1, 4}, P = {C0, C1, C2, C3, C4, C5, C6}, N2 = {2, t}, and transfer is made to Step 1.	cache/ijassa-744.pdf	txt/ijassa-744.txt