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

From MaRDI portal
Revision as of 15:01, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/dam/FeigenbaumHS85, #quickstatements; #temporary_batch_1731505720702)
(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

    title
    A polynomial time algorithm for finding the prime factors of Cartesian- product graphs (English)
    0 references
    author
    Joan Feigenbaum
    0 references
    Alejandro A. Schäffer
    0 references
    J. E. Hershberger
    0 references
    publication date
    1985
    0 references

    Identifiers

    zbMATH DE Number
    3928347
    0 references
    Wikidata QID
    Q56688308
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1067411&oldid=37905976"
    Powered by MediaWiki