A general purpose algorithm for counting simple cycles and simple paths of any length (Q2415361)

From MaRDI portal
Revision as of 07:05, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
A general purpose algorithm for counting simple cycles and simple paths of any length
scientific article

    Statements

    A general purpose algorithm for counting simple cycles and simple paths of any length (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 May 2019
    0 references
    simple cycles
    0 references
    simple paths
    0 references
    self-avoiding walks
    0 references
    self-avoiding polygons
    0 references
    elementary circuits
    0 references
    connected induced subgraphs
    0 references
    networks
    0 references
    digraphs
    0 references
    labeled graphs
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references