On the complexity of strongly connected components in directed hypergraphs (Q517789)

From MaRDI portal
Revision as of 20:08, 9 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the complexity of strongly connected components in directed hypergraphs
scientific article

    Statements

    On the complexity of strongly connected components in directed hypergraphs (English)
    0 references
    0 references
    0 references
    27 March 2017
    0 references
    directed hypergraphs
    0 references
    strongly connected components
    0 references
    minimal set problem
    0 references
    subset partial order
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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