GIT—a heuristic program for testing pairs of directed line graphs for isomorphism (Q5736478): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/363872.363899 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1971184080 / rank | |||
Normal rank | |||
Latest revision as of 19:39, 19 March 2024
scientific article; zbMATH DE number 3200107
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | GIT—a heuristic program for testing pairs of directed line graphs for isomorphism |
scientific article; zbMATH DE number 3200107 |
Statements
GIT—a heuristic program for testing pairs of directed line graphs for isomorphism (English)
0 references
1964
0 references
numerical analysis
0 references
