Holiest minimum-cost paths and flows in surface graphs (Q5230385)
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 7097089
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Holiest minimum-cost paths and flows in surface graphs |
scientific article; zbMATH DE number 7097089 |
Statements
Holiest minimum-cost paths and flows in surface graphs (English)
0 references
22 August 2019
0 references
computational topology
0 references
graphs
0 references
network flows
0 references
shortest paths
0 references
surfaces
0 references
0 references
0.8476516
0 references
0.8474239
0 references
0.8474238
0 references
0 references
0.84486854
0 references
0.84486854
0 references
0.84311557
0 references
0.84138906
0 references
