| Display title | Kernighan–Lin algorithm |
| Default sort key | Kernighan-Lin algorithm |
| Page length (in bytes) | 4,382 |
| Namespace ID | 0 |
| Page ID | 23174224 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of page watchers | Fewer than 30 watchers |
| Number of redirects to this page | 5 |
| Counted as a content page | Yes |
| Wikidata item ID | Q2802593 |
| Local description | Heuristic algorithm for finding partitions of graphs |
| Central description | algorithm for graph partitioning |
| Page views in the past 30 days | |
| Edit | Allow all users (no expiry set) |
| Move | Allow all users (no expiry set) |
| Page creator | Ruud Koot (talk | contribs) |
| Date of page creation | 22:00, 10 June 2009 |
| Latest editor | Cornmazes (talk | contribs) |
| Date of latest edit | 13:30, 31 October 2025 |
| Total number of edits | 66 |
| Recent number of edits (within past 30 days) | 1 |
| Recent number of distinct authors | 1 |
| Hidden categories (2) | This page is a member of 2 hidden categories (help):
|
| Transcluded templates (38) | Pages transcluded onto the current version of this page (help):
|
| Wikidata entities used in this page | |
