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

From MaRDI portal
Revision as of 03:33, 14 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    1981
    0 references
    0 references
    maximal clique
    0 references