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 |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9057366847991944
0 references
0.8572795391082764
0 references
0.8478789329528809
0 references
0.834807276725769
0 references
0.8331931233406067
0 references
