Circulant graphs and GCD and LCM of subsets (Q477605)

From MaRDI portal
Revision as of 11:03, 9 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Circulant graphs and GCD and LCM of subsets
scientific article

    Statements

    title
    Circulant graphs and GCD and LCM of subsets (English)
    0 references
    publication date
    9 December 2014
    0 references
    zbMATH Keywords
    analysis of algorithms
    0 references
    computational complexity
    0 references
    graph algorithms
    0 references
    circulant graphs
    0 references
    minimum cover
    0 references

    Identifiers

    Mathematics Subject Classification ID
    11Y16
    0 references
    11A05
    0 references
    05C85
    0 references
    68Q17
    0 references
    68Q25
    0 references
    zbMATH DE Number
    6378641
    0 references
    OpenAlex ID
    W2049583208
    0 references
    arXiv ID
    1402.5449
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q477605&oldid=35428053"
    Powered by MediaWiki