Are there graphs whose shortest path structure requires large edge weights? (Q6906428)
From MaRDI portal
!
WARNING
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 8115337
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Are there graphs whose shortest path structure requires large edge weights? |
scientific article; zbMATH DE number 8115337 |
Statements
Are there graphs whose shortest path structure requires large edge weights? (English)
0 references
4 November 2025
0 references
shortest paths
0 references
graph theory
0 references
weighted graphs
0 references
