Linear-time algorithm for sliding tokens on trees (Q496016)

From MaRDI portal
Revision as of 18:25, 10 July 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
Linear-time algorithm for sliding tokens on trees
scientific article

    Statements

    title
    Linear-time algorithm for sliding tokens on trees (English)
    0 references
    author
    Erik D. Demaine
    0 references
    Martin L. Demaine
    0 references
    Eli Fox-Epstein
    0 references
    Duc A. Hoang
    0 references
    Takehiro Ito
    0 references
    Hirotaka Ono
    0 references
    Yota Otachi
    0 references
    Ryuhei Uehara
    0 references
    Takeshi Yamada
    0 references
    publication date
    16 September 2015
    0 references
    zbMATH Keywords
    combinatorial reconfiguration
    0 references
    graph algorithm
    0 references
    independent set
    0 references
    sliding token
    0 references
    tree
    0 references
    cites work
    Q3395518
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    05C05
    0 references
    05C69
    0 references
    05C85
    0 references
    zbMATH DE Number
    6482887
    0 references
    OpenAlex ID
    W2169085828
    0 references
    arXiv ID
    1406.6576
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q496016&oldid=36201285"
    Powered by MediaWiki