Simple greedy 2-approximation algorithm for the maximum genus of a graph (Q6593569)
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 7902017
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simple greedy 2-approximation algorithm for the maximum genus of a graph |
scientific article; zbMATH DE number 7902017 |
Statements
Simple greedy 2-approximation algorithm for the maximum genus of a graph (English)
0 references
26 August 2024
0 references
maximum genus
0 references
embedding
0 references
graph algorithm
0 references
greedy algorithm
0 references
0.8026459217071533
0 references
0.7685513496398926
0 references
0.7660563588142395
0 references
