The complexity of bottleneck labeled graph problems (Q5961969)

From MaRDI portal
Revision as of 05:04, 22 December 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5786334
Language Label Description Also known as
English
The complexity of bottleneck labeled graph problems
scientific article; zbMATH DE number 5786334

    Statements

    The complexity of bottleneck labeled graph problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 September 2010
    0 references
    bottleneck labeled problems
    0 references
    approximation algorithms
    0 references
    hardness of approximation
    0 references
    \(s\)-\(t\) path
    0 references
    \(s\)-\(t\) cut
    0 references
    spanning tree
    0 references
    perfect matching
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references