A contraction algorithm for finding small cycle cutsets (Q3813312)

From MaRDI portal
Revision as of 00:11, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A contraction algorithm for finding small cycle cutsets
scientific article

    Statements

    title
    A contraction algorithm for finding small cycle cutsets (English)
    0 references
    author
    Hanoch Levy
    0 references
    David W. Low
    0 references
    publication date
    1988
    0 references
    zbMATH Keywords
    directed graph
    0 references
    NP-complete
    0 references
    contraction
    0 references
    minimum cutset
    0 references
    quasi-reducible graphs
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    05C20
    0 references
    05C35
    0 references
    68W99
    0 references
    68Q25
    0 references
    zbMATH DE Number
    4083001
    0 references
    OpenAlex ID
    W1984425270
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3813312&oldid=32332251"
    Powered by MediaWiki