An improved FPT algorithm for almost forest deletion problem (Q1751414)

From MaRDI portal
Revision as of 17:40, 15 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
An improved FPT algorithm for almost forest deletion problem
scientific article

    Statements

    title
    An improved FPT algorithm for almost forest deletion problem (English)
    0 references
    author
    Mugang Lin
    0 references
    Qilong Feng
    0 references
    Jianxin Wang
    0 references
    Bin Fu
    0 references
    Wenjun Li
    0 references
    Jian'er Chen
    0 references
    publication date
    25 May 2018
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    05C85
    0 references
    68Q27
    0 references
    68W40
    0 references
    zbMATH DE Number
    6873284
    0 references
    zbMATH Keywords
    fixed-parameter algorithm
    0 references
    feedback vertex set
    0 references
    almost forest deletion
    0 references
    iterative compression
    0 references
    graph algorithms
    0 references
    OpenAlex ID
    W2794538300
    0 references
    cites work
    Q4488089
    0 references
    Q4503944
    0 references
    Q5710169
    0 references
    Q4293112
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1751414&oldid=36392992"
    Powered by MediaWiki