Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs (Q3449818)

From MaRDI portal
Revision as of 23:25, 10 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
Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs
scientific article

    Statements

    title
    Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs (English)
    0 references
    author
    Christophe Crespelle
    0 references
    Tien-Nam Le
    0 references
    Kévin Perrot
    0 references
    Thi Ha Duong Phan
    0 references
    publication date
    30 October 2015
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C85
    0 references
    05C12
    0 references
    68Q25
    0 references
    zbMATH DE Number
    6502354
    0 references
    OpenAlex ID
    W2408185282
    0 references
    arXiv ID
    1803.05414
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3449818&oldid=36209700"
    Powered by MediaWiki