An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs (Q472490): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by the same user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s00453-013-9765-4 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00453-013-9765-4 / rank | |||
Normal rank | |||
Latest revision as of 18:34, 9 December 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
0 references
0 references
0 references
0 references
