A polynomial time algorithm for finding the prime factors of Cartesian- product graphs (Q1067411): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/dam/FeigenbaumHS85, #quickstatements; #temporary_batch_1731505720702 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/dam/FeigenbaumHS85 / rank | |||
Normal rank | |||
Latest revision as of 15:01, 13 November 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
