Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem (Q3503575)

From MaRDI portal
Revision as of 20:58, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem
scientific article

    Statements

    title
    Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem (English)
    0 references
    author
    Omid Amini
    0 references
    Ignasi Sau
    0 references
    Saket Saurabh
    0 references
    publication date
    5 June 2008
    0 references

    Identifiers

    zbMATH DE Number
    5285021
    0 references
    OpenAlex ID
    W1512704402
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3503575&oldid=31870145"
    Powered by MediaWiki