Finding shortest non-separating and non-contractible cycles for topologically embedded graphs (Q878074): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00454-006-1292-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1522210445 / rank | |||
Normal rank | |||
Latest revision as of 21:18, 19 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
