On computing the 2-vertex-connected components of directed graphs (Q266828)
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 6566293
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On computing the 2-vertex-connected components of directed graphs |
scientific article; zbMATH DE number 6566293 |
Statements
On computing the 2-vertex-connected components of directed graphs (English)
0 references
7 April 2016
0 references
graph algorithms
0 references
2-vertex-connected components
0 references
strong articulation points
0 references
approximation algorithms
0 references
0 references
0.93759465
0 references
0.9241458
0 references
0.9241457
0 references
0.91606706
0 references
0.90402716
0 references
0 references
0.89414966
0 references
0 references
0 references
