Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental Study (Q5232736)
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: Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental Study |
scientific article; zbMATH DE number 7104625
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental Study |
scientific article; zbMATH DE number 7104625 |
Statements
Computing 2-Connected Components and Maximal 2-Connected Subgraphs in Directed Graphs: An Experimental Study (English)
0 references
12 September 2019
0 references
