A polynomial time algorithm for finding the prime factors of Cartesian- product graphs (Q1067411)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A polynomial time algorithm for finding the prime factors of Cartesian- product graphs |
scientific article; zbMATH DE number 3928347
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial time algorithm for finding the prime factors of Cartesian- product graphs |
scientific article; zbMATH DE number 3928347 |
Statements
A polynomial time algorithm for finding the prime factors of Cartesian- product graphs (English)
0 references
1985
0 references
