An overview of graph covering and partitioning (Q2142633)

From MaRDI portal
Revision as of 05:33, 17 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An overview of graph covering and partitioning
scientific article

    Statements

    title
    An overview of graph covering and partitioning (English)
    0 references
    author
    Stephan Schwartz
    0 references
    publication date
    27 May 2022
    0 references
    zbMATH Keywords
    edge covering
    0 references
    vertex covering
    0 references
    graph partitioning
    0 references
    describes a project that uses
    MESHPART
    0 references
    VRP
    0 references
    PERL
    0 references
    MCODE
    0 references
    cites work
    Q3890126
    0 references
    Q4796188
    0 references
    Q2889270
    0 references
    On biclique coverings
    0 references
    Q2912414
    0 references
    Q3360905
    0 references
    Q3312268
    0 references
    Q3701453
    0 references
    Q4448745
    0 references
    Q3659817
    0 references
    The partition problem
    0 references
    Q5387695
    0 references
    Q3691766
    0 references
    Q6075914
    0 references
    Q3753826
    0 references
    Q4344209
    0 references
    Q3877805
    0 references
    Q3138951
    0 references
    Q5663904
    0 references
    Q5203068
    0 references
    Q4016827
    0 references
    STACS 2005
    0 references
    Min-cut clustering
    0 references
    Q3142415
    0 references
    Q3710541
    0 references
    Q5539649
    0 references
    Q4846548
    0 references
    Clustering on trees
    0 references
    Q3035328
    0 references
    Q4152571
    0 references
    Q3942989
    0 references
    Q3922718
    0 references
    Q3922720
    0 references
    Q2912416
    0 references
    Q3309876
    0 references
    Q3137210
    0 references
    Q4540048
    0 references
    Graph clustering
    0 references
    Q4796190
    0 references

    Identifiers

    zbMATH DE Number
    7533000
    0 references
    OpenAlex ID
    W4220901620
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2142633&oldid=38904133"
    Powered by MediaWiki