Information for "A derandomized approximation algorithm for the critical node detection problem"
Basic information
| Display title | A derandomized approximation algorithm for the critical node detection problem |
| Default sort key | A derandomized approximation algorithm for the critical node detection problem |
| Page length (in bytes) | 495 |
| Page ID | 7808 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
Page protection
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
Edit history
| Page creator | 179.215.124.0 (talk) |
| Date of page creation | 17:13, 10 August 2022 |
| Latest editor | 179.215.124.0 (talk) |
| Date of latest edit | 17:13, 10 August 2022 |
| Total number of edits | 1 |
| Total number of distinct authors | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |