| Display title | Publication:963469 |
| Redirects to | A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs (info) |
| Default sort key | 963469 |
| Page length (in bytes) | 105 |
| Namespace ID | 4206 |
| Namespace | Publication |
| Page ID | 17431893 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Page views in the past month | 0 |
| MaRDI portal item ID | Q963469 |
| Edit | Allow only users with "overwriteprofilepages" permission (infinite) |
| Move | Allow only users with "overwriteprofilepages" permission (infinite) |
| Page creator | AllProfilePages260409040437 (talk | contribs) |
| Date of page creation | 06:21, 12 April 2026 |
| Latest editor | AllProfilePages260409040437 (talk | contribs) |
| Date of latest edit | 06:21, 12 April 2026 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 1 |
| Recent number of distinct authors | 1 |
