Efficient algorithms for a mixed k-partition problem of graphs without specifying bases (Q6184380)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient algorithms for a mixed k-partition problem of graphs without specifying bases |
scientific article; zbMATH DE number 7784136
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for a mixed k-partition problem of graphs without specifying bases |
scientific article; zbMATH DE number 7784136 |
Statements
Efficient algorithms for a mixed k-partition problem of graphs without specifying bases (English)
0 references
5 January 2024
0 references
0 references
0 references
0.9993292093276978
0 references
0.820661187171936
0 references
0.8011826872825623
0 references
