Finding a shortest non-zero path in group-labeled graphs via permanent computation (Q524371): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C78 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C85 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C12 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68W20 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6710371 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
group-labeled graphs | |||
| Property / zbMATH Keywords: group-labeled graphs / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
non-zero shortest path | |||
| Property / zbMATH Keywords: non-zero shortest path / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
permanent | |||
| Property / zbMATH Keywords: permanent / rank | |||
Normal rank | |||
Revision as of 07:13, 1 July 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding a shortest non-zero path in group-labeled graphs via permanent computation |
scientific article |
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
