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

From MaRDI portal
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 03:23, 5 March 2024

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
    0 references
    0 references