Linear kernels and linear-time algorithms for finding large cuts (Q722541)

From MaRDI portal
Revision as of 06:35, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/algorithmica/EtscheidM18, #quickstatements; #temporary_batch_1731475607626)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Linear kernels and linear-time algorithms for finding large cuts
scientific article

    Statements

    title
    Linear kernels and linear-time algorithms for finding large cuts (English)
    0 references
    author
    Michael Etscheid
    0 references
    Matthias Mnich
    0 references
    published in
    Algorithmica
    0 references
    publication date
    26 July 2018
    0 references
    zbMATH Keywords
    max-cut
    0 references
    kernelization
    0 references
    linear-time algorithms
    0 references
    cites work
    Q4550236
    0 references
    Q2957516
    0 references
    Q4840774
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    05C85
    0 references
    68R10
    0 references
    zbMATH DE Number
    6911200
    0 references
    OpenAlex ID
    W2766740319
    0 references
    Wikidata QID
    Q59527637
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q722541&oldid=37898331"
    Powered by MediaWiki