Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs (Q4575870): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2955681777 / rank | |||
Normal rank | |||
Revision as of 00:14, 20 March 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
