On the graph turnpike problem (Q989483): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Low-distortion embeddings of general metrics into the line / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3803160 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A tight bound on approximating arbitrary metrics by tree metrics / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximating the bandwidth via volume respecting embeddings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Improved Bandwidth Approximation for Trees and Chordal Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Embedding tree metrics into low dimensional Euclidean spaces / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5692717 / rank | |||
Normal rank | |||
Revision as of 02:20, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the graph turnpike problem |
scientific article |
Statements
On the graph turnpike problem (English)
0 references
20 August 2010
0 references
graph turnpike problem
0 references
graph algorithms
0 references
computational geometry
0 references
