How to make a strongly connected digraph two-connected (Q5101433)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: How to make a strongly connected digraph two-connected |
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
