Finding shortest non-separating and non-contractible cycles for topologically embedded graphs (Q878074)
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 non-separating and non-contractible cycles for topologically embedded graphs |
scientific article; zbMATH DE number 5146120
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding shortest non-separating and non-contractible cycles for topologically embedded graphs |
scientific article; zbMATH DE number 5146120 |
Statements
Finding shortest non-separating and non-contractible cycles for topologically embedded graphs (English)
0 references
26 April 2007
0 references
algorithm
0 references
genus
0 references
surface
0 references
face-width
0 references
0.9837253093719482
0 references
0.9011707901954652
0 references
0.8752261400222778
0 references
0.8721737265586853
0 references
0.8633695244789124
0 references
