| Display title | Subgraph isomorphism problem |
| Default sort key | Subgraph Isomorphism Problem |
| Page length (in bytes) | 15,368 |
| Namespace ID | 0 |
| Page ID | 450062 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of page watchers | 52 |
| Number of page watchers who visited in the last 30 days | 3 |
| Number of redirects to this page | 4 |
| Counted as a content page | Yes |
| Wikidata item ID | Q2528185 |
| Local description | Problem in theoretical computer science |
| Central description | the NP-complete problem of testing whether one graph is a subgraph of another |
| Page views in the past 30 days | |
| Edit | Allow all users (no expiry set) |
| Move | Allow all users (no expiry set) |
| Page creator | 24.101.83.241 (talk) |
| Date of page creation | 05:39, 1 February 2004 |
| Latest editor | BagLuke (talk | contribs) |
| Date of latest edit | 22:39, 6 February 2025 |
| Total number of edits | 188 |
| Recent number of edits (within past 30 days) | 0 |
| Recent number of distinct authors | 0 |
| Hidden categories (3) | This page is a member of 3 hidden categories (help):
|
| Transcluded templates (45) | Pages transcluded onto the current version of this page (help):
|
| Wikidata entities used in this page | |
