A paradigm for listing \((s,t)\)-cuts in graphs (Q1911466)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A paradigm for listing \((s,t)\)-cuts in graphs |
scientific article |
Statements
A paradigm for listing \((s,t)\)-cuts in graphs (English)
0 references
13 August 1996
0 references
enumeration
0 references
time-per-cut complexity
0 references
