Finding a shortest non-zero path in group-labeled graphs via permanent computation (Q524371)

From MaRDI portal
Revision as of 01:31, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Finding a shortest non-zero path in group-labeled graphs via permanent computation
scientific article

    Statements

    title
    Finding a shortest non-zero path in group-labeled graphs via permanent computation (English)
    0 references
    author
    Yusuke Kobayashi
    0 references
    Sho Toyooka
    0 references
    published in
    Algorithmica
    0 references
    publication date
    2 May 2017
    0 references
    Mathematics Subject Classification ID
    05C78
    0 references
    05C85
    0 references
    05C12
    0 references
    68W20
    0 references
    zbMATH DE Number
    6710371
    0 references
    zbMATH Keywords
    group-labeled graphs
    0 references
    non-zero shortest path
    0 references
    permanent
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q524371&oldid=25631494"
    Powered by MediaWiki