An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs (Q472490): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:44, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs |
scientific article |
Statements
An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs (English)
0 references
19 November 2014
0 references
graph algorithms
0 references
approximation algorithms
0 references
tree \(t\)-spanner problem
0 references
minimum max-stretch spanning tree problem
0 references
generalized chordal graphs
0 references
Robertson-Seymour's tree-decomposition
0 references
balanced separators
0 references
