Finding shortest non-separating and non-contractible cycles for topologically embedded graphs (Q878074): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:29, 5 March 2024
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
