Identifiability of Graphs with Small Color Classes by the Weisfeiler--Leman Algorithm (Q5009334)

From MaRDI portal
Revision as of 11:07, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7383908
Language Label Description Also known as
English
Identifiability of Graphs with Small Color Classes by the Weisfeiler--Leman Algorithm
scientific article; zbMATH DE number 7383908

    Statements

    Identifiability of Graphs with Small Color Classes by the Weisfeiler--Leman Algorithm (English)
    0 references
    0 references
    0 references
    0 references
    20 August 2021
    0 references
    graph isomorphism
    0 references
    Weisfeiler-Leman algorithm
    0 references
    Cai-Fürer-Immerman graphs
    0 references
    coherent configurations
    0 references
    0 references
    0 references
    0 references

    Identifiers

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