A polynomial algorithm to find an independent set of maximum weight in a fork-free graph (Q5901120)

From MaRDI portal
Revision as of 00:07, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5771586
Language Label Description Also known as
English
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
scientific article; zbMATH DE number 5771586

    Statements

    title
    A polynomial algorithm to find an independent set of maximum weight in a fork-free graph (English)
    0 references
    author
    Vadim V. Lozin
    0 references
    Martin Milanič
    0 references
    publication date
    16 August 2010
    0 references

    Identifiers

    zbMATH DE Number
    5771586
    0 references
    OpenAlex ID
    W4232451777
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5901120&oldid=32522371"
    Powered by MediaWiki