 | This article is rated Stub-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
A section to explain where minimum cut algorithms are useful/needed is missing, would be good to have some examples.
I don't really understand, what this means:
Asymptotically faster algorithms exist for directed graphs, though these do not necessarily extend to the undirected case.
(An algorithm for finding a min cut in a digraph can always be applied in undirected graphs.) — Preceding unsigned comment added by 2001:6A0:5001:2:39E2:E197:D9EF:7 ( talk) 12:14, 17 October 2012 (UTC)
I added the Wayback machine link to the .ps file in the first reference ("4 Min-Cut Algorithms").
I also converted it to PDF which I shared on my Google Drive along with the original PS file:
https://drive.google.com/drive/folders/1T-AV5KDOytzJZdbLnxepUzcvcgCdkhU1?usp=drive_link Doranchak ( talk) 17:53, 17 April 2024 (UTC)
|
| This article is rated Stub-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
A section to explain where minimum cut algorithms are useful/needed is missing, would be good to have some examples.
I don't really understand, what this means:
Asymptotically faster algorithms exist for directed graphs, though these do not necessarily extend to the undirected case.
(An algorithm for finding a min cut in a digraph can always be applied in undirected graphs.) — Preceding unsigned comment added by 2001:6A0:5001:2:39E2:E197:D9EF:7 ( talk) 12:14, 17 October 2012 (UTC)
I added the Wayback machine link to the .ps file in the first reference ("4 Min-Cut Algorithms").
I also converted it to PDF which I shared on my Google Drive along with the original PS file:
https://drive.google.com/drive/folders/1T-AV5KDOytzJZdbLnxepUzcvcgCdkhU1?usp=drive_link Doranchak ( talk) 17:53, 17 April 2024 (UTC)