An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs (Q472490)

From MaRDI portal
Revision as of 08:19, 9 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    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
    0 references
    0 references
    0 references

    Identifiers