Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem (Q2985117)

From MaRDI portal
Revision as of 19:20, 13 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
Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem
scientific article

    Statements

    title
    Faster Algorithms for the Minimum Red-Blue-Purple Spanning Graph Problem (English)
    0 references
    author
    Ahmad Biniaz
    0 references
    Prosenjit Bose
    0 references
    Ingo van Duijn
    0 references
    Anil Maheshwari
    0 references
    Michiel H. M. Smid
    0 references
    publication date
    16 May 2017
    0 references
    zbMATH Keywords
    RBP spanning graph
    0 references
    minimum RBP spanning graph problem
    0 references

    Identifiers

    DOI
    10.7155/jgaa.00427
    0 references
    zbMATH DE Number
    6715879
    0 references
    OpenAlex ID
    W2604563026
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2985117&oldid=36321529"
    Powered by MediaWiki