On enumerating minimal dicuts and strongly connected subgraphs (Q2471808): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:08, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On enumerating minimal dicuts and strongly connected subgraphs |
scientific article |
Statements
On enumerating minimal dicuts and strongly connected subgraphs (English)
0 references
18 February 2008
0 references
