The energy complexity of diameter and minimum cut computation in bounded-genus networks (Q6199403)
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 7809117
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The energy complexity of diameter and minimum cut computation in bounded-genus networks |
scientific article; zbMATH DE number 7809117 |
Statements
The energy complexity of diameter and minimum cut computation in bounded-genus networks (English)
0 references
23 February 2024
0 references
distributed graph algorithms
0 references
0 references
0 references
0 references
