Recognizing binary Hamming graphs inO(n 2 logn) time (Q4850329)
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: Recognizing binary Hamming graphs inO(n 2 logn) time |
scientific article; zbMATH DE number 803771
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Recognizing binary Hamming graphs inO(n 2 logn) time |
scientific article; zbMATH DE number 803771 |
Statements
Recognizing binary Hamming graphs inO(n 2 logn) time (English)
0 references
9 October 1995
0 references
Hamming graph
0 references
0.8221165537834167
0 references
0.8089737892150879
0 references
