Computing the shortest essential cycle (Q603870)
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: Computing the shortest essential cycle |
scientific article; zbMATH DE number 5813756
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the shortest essential cycle |
scientific article; zbMATH DE number 5813756 |
Statements
Computing the shortest essential cycle (English)
0 references
8 November 2010
0 references
computational topology
0 references
topological graph theory
0 references
combinatorial surface
0 references
essential cycles
0 references
0 references
0.8282354474067688
0 references
0.8179644346237183
0 references
0.8158540725708008
0 references
0.7973840832710266
0 references
0.792191207408905
0 references
