A non-factorial algorithm for canonical numbering of a graph (Q3339303): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0196-6774(84)90015-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2057640741 / rank | |||
Normal rank | |||
Latest revision as of 02:43, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A non-factorial algorithm for canonical numbering of a graph |
scientific article |
Statements
A non-factorial algorithm for canonical numbering of a graph (English)
0 references
1984
0 references
graph certificate
0 references
canonical form
0 references
graph isomorphism algorithm
0 references
canonical numbering of the vertices
0 references
