A polynomial time algorithm for finding the prime factors of Cartesian- product graphs (Q1067411): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q56688308, #quickstatements; #temporary_batch_1707232231678 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56688308 / rank | |||
Normal rank | |||
Revision as of 16:37, 6 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
