Resolvability of Hamming Graphs (Q5128504)

From MaRDI portal
Revision as of 10:33, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7267530
Language Label Description Also known as
English
Resolvability of Hamming Graphs
scientific article; zbMATH DE number 7267530

    Statements

    title
    Resolvability of Hamming Graphs (English)
    0 references
    author
    Lucas Laird
    0 references
    Richard C. Tillquist
    0 references
    Stephen R. Becker
    0 references
    Manuel E. Lladser
    0 references
    publication date
    27 October 2020
    0 references
    zbMATH Keywords
    graph embedding
    0 references
    Gröbner basis
    0 references
    Hamming distance
    0 references
    Hamming graph
    0 references
    hypercube
    0 references
    integer linear programming
    0 references
    metric dimension
    0 references
    multilateration
    0 references
    resolving set
    0 references
    symbolic data science
    0 references
    describes a project that uses
    SymPy
    0 references
    OEIS
    0 references
    Gurobi
    0 references
    CVX
    0 references
    F5C
    0 references

    Identifiers

    DOI
    10.1137/19M1274511
    0 references
    Mathematics Subject Classification ID
    05C12
    0 references
    05C50
    0 references
    05C62
    0 references
    13P10
    0 references
    68R10
    0 references
    90C35
    0 references
    92C40
    0 references
    zbMATH DE Number
    7267530
    0 references
    arXiv ID
    1907.05974
    0 references
    OpenAlex ID
    W3092210544
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5128504&oldid=37301549"
    Powered by MediaWiki