An NP-completeness result of edge search in graphs (Q2014718)

From MaRDI portal
Revision as of 18:43, 16 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An NP-completeness result of edge search in graphs
scientific article

    Statements

    title
    An NP-completeness result of edge search in graphs (English)
    0 references
    author
    Tatjana Gerzen
    0 references
    publication date
    16 June 2014
    0 references
    zbMATH Keywords
    group testing problem
    0 references
    NP-completeness
    0 references
    combinatorial search
    0 references
    edge search
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C85
    0 references
    05C80
    0 references
    68M15
    0 references
    68P10
    0 references
    68Q17
    0 references
    90C27
    0 references
    zbMATH DE Number
    6304676
    0 references
    OpenAlex ID
    W2075281130
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2014718&oldid=38832372"
    Powered by MediaWiki