A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically (Q1157909)

From MaRDI portal
Revision as of 23:29, 22 February 2024 by RedirectionBot (talk | contribs) (‎Removed claims)
scientific article
Language Label Description Also known as
English
A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically
scientific article

    Statements

    A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically (English)
    0 references
    0 references
    0 references
    1981
    0 references
    0 references
    maximal clique
    0 references