Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph - MaRDI portal

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

From MaRDI portal
scientific article; zbMATH DE number 5509890
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 5509890

    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
    23 February 2009
    0 references
    zbMATH Keywords
    independent set
    0 references
    polynomial-time algorithm
    0 references
    cites work
    Struction revisited
    0 references
    Q4038720
    0 references
    Q3138921
    0 references
    Q5572939
    0 references
    Matching theory
    0 references
    Q3686754
    0 references
    Q3683903
    0 references
    Q4770411
    0 references

    Identifiers

    zbMATH DE Number
    5509890
    0 references
    OpenAlex ID
    W2100432797
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5901434&oldid=35094412"
    Powered by MediaWiki