Spectra of symmetric powers of graphs and the Weisfeiler-Lehman refinements (Q602723): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Symmetric squares of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Random Graph Isomorphism / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An optimal lower bound on the number of variables for graph identification / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4535027 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Equivalence in finite-variable logics is complete for polynomial time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Isomorphism testing for embeddable graphs through definability / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5676231 / rank | |||
Normal rank |
Revision as of 09:56, 3 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Spectra of symmetric powers of graphs and the Weisfeiler-Lehman refinements |
scientific article |
Statements
Spectra of symmetric powers of graphs and the Weisfeiler-Lehman refinements (English)
0 references
5 November 2010
0 references
graph isomorphism problem
0 references
graph spectra
0 references
Weisfeiler-Lehman algorithm
0 references
random walks
0 references