Edge and pair queries-random graphs and complexity (Q6162142)

From MaRDI portal
Revision as of 16:42, 29 April 2024 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7696239
Language Label Description Also known as
English
Edge and pair queries-random graphs and complexity
scientific article; zbMATH DE number 7696239

    Statements

    title
    Edge and pair queries-random graphs and complexity (English)
    0 references
    author
    Dariusz Dereniowski
    0 references
    Paweł Prałat
    0 references
    publication date
    15 June 2023
    0 references
    review text
    Summary: We investigate two types of query games played on a graph, pair queries and edge queries. We concentrate on investigating the two associated graph parameters for binomial random graphs, and showing that determining any of the two parameters is NP-hard for bounded degree graphs.
    0 references
    zbMATH Keywords
    query games
    0 references
    binomial random graphs
    0 references
    bounded degree graphs
    0 references

    Identifiers

    arXiv ID
    2203.06006
    0 references
    DOI
    10.37236/11159
    0 references
    Mathematics Subject Classification ID
    05C57
    0 references
    91A43
    0 references
    05C80
    0 references
    05C12
    0 references
    68Q17
    0 references
    zbMATH DE Number
    7696239
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6162142&oldid=34009512"
      Powered by MediaWiki