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

From MaRDI portal
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

    Finding a shortest non-zero path in group-labeled graphs via permanent computation (English)
    0 references
    0 references
    0 references
    0 references
    2 May 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    group-labeled graphs
    0 references
    non-zero shortest path
    0 references
    permanent
    0 references
    0 references