A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices (Q4128621): 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.1145/321958.321963 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2095052098 / rank | |||
Normal rank | |||
Latest revision as of 22:36, 19 March 2024
scientific article; zbMATH DE number 3556131
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices |
scientific article; zbMATH DE number 3556131 |
Statements
A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices (English)
0 references
1976
0 references
