Ranking on Arbitrary Graphs: Rematch via Continuous Linear Programming (Q4581907)

From MaRDI portal
Revision as of 00:47, 8 October 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q129418969, #quickstatements; #temporary_batch_1728344804049)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6921486
Language Label Description Also known as
English
Ranking on Arbitrary Graphs: Rematch via Continuous Linear Programming
scientific article; zbMATH DE number 6921486

    Statements

    title
    Ranking on Arbitrary Graphs: Rematch via Continuous Linear Programming (English)
    0 references
    author
    T-H. Hubert Chan
    0 references
    Fei Chen
    0 references
    Xiaowei Wu
    0 references
    Zhichao Zhao
    0 references
    publication date
    21 August 2018
    0 references
    zbMATH Keywords
    oblivious matching problem
    0 references
    continuous linear programming
    0 references
    ranking algorithm
    0 references

    Identifiers

    DOI
    10.1137/140984051
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    05C70
    0 references
    68W20
    0 references
    90C35
    0 references
    zbMATH DE Number
    6921486
    0 references
    OpenAlex ID
    W2886153187
    0 references
    Wikidata QID
    Q129418969
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4581907&oldid=37854448"
    Powered by MediaWiki