How to make a strongly connected digraph two-connected (Q5101433): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 18:48, 5 March 2024
scientific article; zbMATH DE number 7577909
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How to make a strongly connected digraph two-connected |
scientific article; zbMATH DE number 7577909 |
Statements
How to make a strongly connected digraph two-connected (English)
0 references
30 August 2022
0 references
combinatorial polynomial algorithm
0 references
