Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm (Q5874317): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
label / enlabel / en
 
Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.STACS.2020.43 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.4230/LIPIcs.STACS.2020.43 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3013311535 / rank
 
Normal rank
Property / title
 
Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm (English)
Property / title: Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm (English) / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.STACS.2020.43 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:43, 30 December 2024

scientific article; zbMATH DE number 7650928
Language Label Description Also known as
English
Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm
scientific article; zbMATH DE number 7650928

    Statements

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

    Identifiers