Maximum incomplete recursive circulants in graph embeddings (Q2788730)

From MaRDI portal
Revision as of 03:17, 14 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Maximum incomplete recursive circulants in graph embeddings
scientific article

    Statements

    Maximum incomplete recursive circulants in graph embeddings (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    22 February 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    embedding
    0 references
    congestion
    0 references
    wire length
    0 references
    recursive circulant
    0 references