Finding shortest contractible and shortest separating cycles in embedded graphs (Q4633873)
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: Finding shortest contractible and shortest separating cycles in embedded graphs |
scientific article; zbMATH DE number 7051230
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding shortest contractible and shortest separating cycles in embedded graphs |
scientific article; zbMATH DE number 7051230 |
Statements
6 May 2019
0 references
1.0000008344650269
0 references
0.8622269630432129
0 references
0.8490703105926514
0 references
0.8318821787834167
0 references
0.824163019657135
0 references
