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

From MaRDI portal
Revision as of 11:21, 12 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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