Sparse certificates for 2-connectivity in directed graphs (Q1676306)
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: Sparse certificates for 2-connectivity in directed graphs |
scientific article; zbMATH DE number 6803097
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sparse certificates for 2-connectivity in directed graphs |
scientific article; zbMATH DE number 6803097 |
Statements
Sparse certificates for 2-connectivity in directed graphs (English)
0 references
6 November 2017
0 references
graph algorithms
0 references
connectivity
0 references
directed graph
0 references
dominators
0 references
flow graph
0 references
large-scale graphs
0 references
0 references
0 references
0 references
0 references
0.8676714897155762
0 references
0.835639238357544
0 references
0.8339389562606812
0 references
0.8208044171333313
0 references
0.8164961338043213
0 references
