Shortest Reconfiguration of Perfect Matchings via Alternating Cycles (Q5074950)

From MaRDI portal
Revision as of 10:42, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7524461
Language Label Description Also known as
English
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles
scientific article; zbMATH DE number 7524461

    Statements

    title
    Shortest Reconfiguration of Perfect Matchings via Alternating Cycles (English)
    0 references
    author
    Takehiro Ito
    0 references
    Naonori Kakimura
    0 references
    Naoyuki Kamiyama
    0 references
    Yusuke Kobayashi
    0 references
    Yoshio Okamoto
    0 references
    publication date
    10 May 2022
    0 references
    zbMATH Keywords
    graph algorithms
    0 references
    matching
    0 references
    combinatorial reconfiguration
    0 references
    combinatorial shortest paths
    0 references
    cites work
    Q4606338
    0 references

    Identifiers

    DOI
    10.1137/20M1364370
    0 references
    Mathematics Subject Classification ID
    05C70
    0 references
    05C85
    0 references
    52B05
    0 references
    68Q17
    0 references
    zbMATH DE Number
    7524461
    0 references
    OpenAlex ID
    W2955954498
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5074950&oldid=37132865"
    Powered by MediaWiki