The complexity of testing whether a graph is a superconcentrator (Q1162529)

From MaRDI portal
Revision as of 15:54, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/ipl/BlumKVPY81, #quickstatements; #temporary_batch_1731508824982)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The complexity of testing whether a graph is a superconcentrator
scientific article

    Statements

    title
    The complexity of testing whether a graph is a superconcentrator (English)
    0 references
    author
    O. Vornberger
    0 references
    Mihalis Yannakakis
    0 references
    Manuel Blum
    0 references
    Richard M. Karp
    0 references
    publication date
    1981
    0 references
    zbMATH Keywords
    concentrator
    0 references
    superconcentrator
    0 references
    NP-completeness
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C99
    0 references
    68Q25
    0 references
    68R10
    0 references
    zbMATH DE Number
    3756533
    0 references
    Wikidata QID
    Q97309514
    0 references
    OpenAlex ID
    W1968864043
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1162529&oldid=37907919"
    Powered by MediaWiki