Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs (Q4575870): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:13, 7 February 2024
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
