Faster algorithms for computing maximal 2-connected subgraphs in sparse directed graphs (Q4575870)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6904152
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster algorithms for computing maximal 2-connected subgraphs in sparse directed graphs |
scientific article; zbMATH DE number 6904152 |
Statements
Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs (English)
0 references
16 July 2018
0 references
0.8654224872589111
0 references
0.8572795391082764
0 references
0.8468467593193054
0 references
0.8429140448570251
0 references
0.835639238357544
0 references
