A polynomial time algorithm for finding the prime factors of Cartesian- product graphs (Q1067411)

From MaRDI portal
Revision as of 18:44, 14 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
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
    0 references
    0 references
    0 references
    1985
    0 references

    Identifiers