An optimal lower bound on the number of variables for graph identification (Q1204528)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An optimal lower bound on the number of variables for graph identification |
scientific article; zbMATH DE number 130620
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal lower bound on the number of variables for graph identification |
scientific article; zbMATH DE number 130620 |
Statements
An optimal lower bound on the number of variables for graph identification (English)
0 references
10 March 1993
0 references
graph identification
0 references
first-order logic with counting
0 references
Weisfeiler-Lehman method
0 references
0.87864935
0 references
0.87698066
0 references
0.8648517
0 references
0.85881305
0 references
0.8528218
0 references
0.8518449
0 references
0.84942913
0 references
0.84901685
0 references
0.84783787
0 references
