Max-flow min-cut theorem for directed fuzzy incidence networks (Q6578238)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Max-flow min-cut theorem for directed fuzzy incidence networks |
scientific article; zbMATH DE number 7886652
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Max-flow min-cut theorem for directed fuzzy incidence networks |
scientific article; zbMATH DE number 7886652 |
Statements
Max-flow min-cut theorem for directed fuzzy incidence networks (English)
0 references
25 July 2024
0 references
directed fuzzy incidence network (DFIN)
0 references
legal flow on a DFIN
0 references
resultant legal flow
0 references
maximum legal flow
0 references
\(\eta\)-saturated and \(\eta\)-unsaturated arcs
0 references
arc cut
0 references
\(\eta\)-enhancing path
0 references
enhanced legal flow
0 references
0 references