Finding shortest non-trivial cycles in directed graphs on surfaces (Q5405878)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6278566
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding shortest non-trivial cycles in directed graphs on surfaces |
scientific article; zbMATH DE number 6278566 |
Statements
Finding shortest non-trivial cycles in directed graphs on surfaces (English)
0 references
3 April 2014
0 references
computational topology
0 references
directed graph
0 references
embedded graph
0 references
non-contractible cycle
0 references
non-separating cycle
0 references
surface
0 references
topological graph theory
0 references
0.981207013130188
0 references
0.936074435710907
0 references
0.9311267137527466
0 references
