On complexity of multidistance graph recognition in \(\mathbb{R}^1\) (Q1690053)

From MaRDI portal
Revision as of 15:30, 25 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
On complexity of multidistance graph recognition in \(\mathbb{R}^1\)
scientific article

    Statements

    On complexity of multidistance graph recognition in \(\mathbb{R}^1\) (English)
    0 references
    0 references
    18 January 2018
    0 references
    computational complexity
    0 references
    geometric graphs
    0 references
    graph homomorphism
    0 references
    Cayley graphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references