Finding shortest non-separating and non-contractible cycles for topologically embedded graphs (Q878074)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding shortest non-separating and non-contractible cycles for topologically embedded graphs |
scientific article |
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
