Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs (Q4575870): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2955681777 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1705.10709 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 18:28, 19 April 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
