Empirical study on sufficient numbers of minimum cuts in strongly connected directed random graphs (Q6092652)
From MaRDI portal
scientific article; zbMATH DE number 7769709
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Empirical study on sufficient numbers of minimum cuts in strongly connected directed random graphs |
scientific article; zbMATH DE number 7769709 |
Statements
Empirical study on sufficient numbers of minimum cuts in strongly connected directed random graphs (English)
0 references
23 November 2023
0 references
all-pairs minimum cut
0 references
directed graphs
0 references
flow cut
0 references
graph partitioning
0 references
minimum cuts
0 references
network flow
0 references
replication cut
0 references
symmetric cuts
0 references
