An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset (Q3902508)

From MaRDI portal
Revision as of 13:20, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset
scientific article

    Statements

    title
    An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset (English)
    0 references
    author
    Shuji Tsukiyama
    0 references
    Isao Shirakawa
    0 references
    Hiroshi Ozaki
    0 references
    Hiromu Ariyoshi
    0 references
    publication date
    1980
    0 references
    zbMATH Keywords
    graph algorithms
    0 references
    backtracking
    0 references

    Identifiers

    DOI
    10.1145/322217.322220
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    68Q25
    0 references
    68W99
    0 references
    zbMATH DE Number
    3711403
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3902508&oldid=28167151"
    Powered by MediaWiki