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 this page instead for the normal view: Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs |
scientific article; zbMATH DE number 6904152
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
