The complexity of growing a graph (Q6112002)

From MaRDI portal
Revision as of 06:19, 10 July 2024 by Import240710060729 (talk | contribs) (Added link to MaRDI item.)
scientific article; zbMATH DE number 7722896
Language Label Description Also known as
English
The complexity of growing a graph
scientific article; zbMATH DE number 7722896

    Statements

    title
    The complexity of growing a graph (English)
    0 references
    author
    George B. Mertzios
    0 references
    Othon Michail
    0 references
    George Skretas
    0 references
    Paul G. Spirakis
    0 references
    Michail Theofilatos
    0 references
    publication date
    4 August 2023
    0 references
    zbMATH Keywords
    temporal graph
    0 references
    cop-win graph
    0 references
    graph process
    0 references
    polynomial-time algorithm
    0 references
    lower bound
    0 references
    NP-complete
    0 references
    hardness result
    0 references

    Identifiers

    arXiv ID
    2107.14126
    0 references
    zbMATH DE Number
    7722896
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6112002&oldid=35563423"
    Powered by MediaWiki