A polynomial time algorithm for finding the prime factors of Cartesian- product graphs (Q1067411): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:00, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial time algorithm for finding the prime factors of Cartesian- product graphs |
scientific article |
Statements
A polynomial time algorithm for finding the prime factors of Cartesian- product graphs (English)
0 references
1985
0 references
