| Display title | A combinatorial strongly polynomial algorithm for minimizing submodular functions |
| Default sort key | A combinatorial strongly polynomial algorithm for minimizing submodular functions |
| Page length (in bytes) | 15 |
| Namespace ID | 0 |
| Page ID | 15115603 |
| 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 |
| Page views in the past month | 0 |
| MaRDI portal item ID | Q6829277 |
| Central description | scientific article; zbMATH DE number 5234644 |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | ZbMATH-Importer (talk | contribs) |
| Date of page creation | 16:11, 24 February 2026 |
| Latest editor | ZbMATH-Importer (talk | contribs) |
| Date of latest edit | 16:11, 24 February 2026 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 1 |
| Recent number of distinct authors | 1 |
| Transcluded templates (16) | Pages included on this page:
|
| MaRDI portal entities used in this page | |
