Finding shortest non-trivial cycles in directed graphs on surfaces (Q2970447)
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: Finding shortest non-trivial cycles in directed graphs on surfaces |
scientific article; zbMATH DE number 6698303
| 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 6698303 |
Statements
30 March 2017
0 references
Finding shortest non-trivial cycles in directed graphs on surfaces (English)
0 references
0.981207013130188
0 references
0.9210111498832704
0 references
0.9208054542541504
0 references
0.8546003103256226
0 references
