On enumerating minimal dicuts and strongly connected subgraphs (Q2471808): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00453-007-9074-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2021178630 / rank | |||
Normal rank | |||
Revision as of 20:57, 19 March 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
