A polynomial time algorithm for finding the prime factors of Cartesian- product graphs (Q1067411): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Algorithm 97 / rank | |||
Normal rank | |||
Revision as of 22:31, 29 February 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
