| Display title | Edmonds' algorithm |
| Default sort key | Edmonds' algorithm |
| Page length (in bytes) | 8,480 |
| Namespace ID | 0 |
| Page ID | 11510650 |
| 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 | Q1752324 |
| Local description | Algorithm for the directed version of the minimum spanning tree problem |
| Central description | algorithm for finding optimal branchings in graph theory |
| Page views in the past 30 days | |
| Edit | Allow all users (no expiry set) |
| Move | Allow all users (no expiry set) |
| Page creator | Neuralwiki (talk | contribs) |
| Date of page creation | 22:00, 30 May 2007 |
| Latest editor | DanilaBudylyov (talk | contribs) |
| Date of latest edit | 15:31, 23 January 2025 |
| Total number of edits | 113 |
| Recent number of edits (within past 30 days) | 0 |
| Recent number of distinct authors | 0 |
| Hidden categories (2) | This page is a member of 2 hidden categories (help):
|
| Transcluded templates (45) | Pages transcluded onto the current version of this page (help):
|
| Wikidata entities used in this page | |
