Fast approximation algorithms for cut-based problems in undirected graphs (Q6990323)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8033980
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast approximation algorithms for cut-based problems in undirected graphs |
scientific article; zbMATH DE number 8033980 |
Statements
Fast approximation algorithms for cut-based problems in undirected graphs (English)
0 references
29 April 2025
0 references
