Edge ranking of graphs is hard (Q1392547)

From MaRDI portal
Revision as of 12:41, 20 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
Edge ranking of graphs is hard
scientific article

    Statements

    title
    Edge ranking of graphs is hard (English)
    0 references
    author
    Tak-Wah Lam
    0 references
    Fung Ling Yue
    0 references
    publication date
    10 December 1998
    0 references
    zbMATH Keywords
    graph labeling algorithms
    0 references
    edge ranking
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    68R10
    0 references
    05C78
    0 references
    zbMATH DE Number
    1180318
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1392547&oldid=1705435"
      Powered by MediaWiki