Towards bypassing lower bounds for graph shortcuts (Q6657035)
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 7961918
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Towards bypassing lower bounds for graph shortcuts |
scientific article; zbMATH DE number 7961918 |
Statements
Towards bypassing lower bounds for graph shortcuts (English)
0 references
6 January 2025
0 references
directed shortcuts
0 references
hopsets
0 references
emulators
0 references
