The Complexity of Bottleneck Labeled Graph Problems (Q3508579)

From MaRDI portal
Revision as of 11:59, 28 June 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
The Complexity of Bottleneck Labeled Graph Problems
scientific article

    Statements

    title
    The Complexity of Bottleneck Labeled Graph Problems (English)
    0 references
    author
    Refael Hassin
    0 references
    Jérôme Monnot
    0 references
    Danny Segev
    0 references
    publication date
    1 July 2008
    0 references
    cites work
    Q4659605
    0 references
    Q4198056
    0 references
    Q3048571
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    05C78
    0 references
    05C85
    0 references
    68Q17
    0 references
    68W25
    0 references
    90C35
    0 references
    90C59
    0 references
    zbMATH DE Number
    5294921
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3508579&oldid=35062803"
    Powered by MediaWiki