Efficient non-isomorphic graph enumeration algorithms for subclasses of perfect graphs (Q6091158)

From MaRDI portal
Revision as of 06:47, 27 April 2024 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7770289
Language Label Description Also known as
English
Efficient non-isomorphic graph enumeration algorithms for subclasses of perfect graphs
scientific article; zbMATH DE number 7770289

    Statements

    Efficient non-isomorphic graph enumeration algorithms for subclasses of perfect graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    24 November 2023
    0 references
    enumeration
    0 references
    binary decision diagrams
    0 references
    graph isomorphism
    0 references
    graph classes
    0 references
    string representation
    0 references

    Identifiers