| Display title | Strong connectivity augmentation |
| Default sort key | Strong connectivity augmentation |
| Page length (in bytes) | 9,353 |
| Namespace ID | 0 |
| Page ID | 324700 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>MainAI6 |
| Date of page creation | 05:52, 28 September 2021 |
| Latest editor | imported>MainAI6 |
| Date of latest edit | 05:52, 28 September 2021 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | Strong connectivity augmentation is a computational problem in the mathematical study of graph algorithms, in which the input is a directed graph and the goal of the problem is to add a small number of edges, or a set of edges with small total weight, so that the added edges make the graph into a strongly... |
