A fast algorithm for source-wise round-trip spanners (Q2034785)
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: A fast algorithm for source-wise round-trip spanners |
scientific article; zbMATH DE number 7362189
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast algorithm for source-wise round-trip spanners |
scientific article; zbMATH DE number 7362189 |
Statements
A fast algorithm for source-wise round-trip spanners (English)
0 references
23 June 2021
0 references
graph spanners
0 references
round-trip spanners
0 references
graph algorithms
0 references
graph partitioning
0 references
0 references
0.89042157
0 references
0.87737995
0 references
0.8744959
0 references
0.8711808
0 references
0.8694154
0 references
0.8659866
0 references
