| Display title | An approximation algorithm for minimum-cost vertex-connectivity problems |
| Default sort key | An approximation algorithm for minimum-cost vertex-connectivity problems |
| Page length (in bytes) | 15 |
| Namespace ID | 0 |
| Page ID | 12621816 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 1 |
| Counted as a content page | Yes |
| Page views in the past month | 0 |
| MaRDI portal item ID | Q679445 |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | Import240305080351 (talk | contribs) |
| Date of page creation | 01:38, 6 March 2024 |
| Latest editor | AllProfilePages260409040437 (talk | contribs) |
| Date of latest edit | 15:49, 11 April 2026 |
| Total number of edits | 2 |
| Recent number of edits (within past 90 days) | 1 |
| Recent number of distinct authors | 1 |
