Finding a shortest non-zero path in group-labeled graphs via permanent computation (Q524371)
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 a shortest non-zero path in group-labeled graphs via permanent computation |
scientific article; zbMATH DE number 6710371
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding a shortest non-zero path in group-labeled graphs via permanent computation |
scientific article; zbMATH DE number 6710371 |
Statements
Finding a shortest non-zero path in group-labeled graphs via permanent computation (English)
0 references
2 May 2017
0 references
group-labeled graphs
0 references
non-zero shortest path
0 references
permanent
0 references
0.92581654
0 references
0.8740315
0 references
0.8728035
0 references
0.86308837
0 references
0.8571469
0 references
0.8564587
0 references
0.85101247
0 references
0.85064214
0 references
0.8500382
0 references
