Information for "Publication:765501"
From MaRDI portal
Publication:765501
Basic information
| Display title | Constant factor approximation algorithms for the densest \(k\)-subgraph problem on proper interval graphs and bipartite permutation graphs |
| Default sort key | 765501 |
| Page length (in bytes) | 15 |
| Namespace ID | 4206 |
| Namespace | Publication |
| Page ID | 8830310 |
| 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 |
| MaRDI portal item ID | Q765501 |
| Central description | scientific article |
Page protection
| Edit | Allow only users with "overwriteprofilepages" permission (infinite) |
| Move | Allow only users with "overwriteprofilepages" permission (infinite) |
Edit history
| Page creator | Import240129110113 (talk | contribs) |
| Date of page creation | 10:26, 30 January 2024 |
| Latest editor | Import240129110113 (talk | contribs) |
| Date of latest edit | 10:26, 30 January 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 365 days) | 1 |
| Recent number of distinct authors | 1 |
