Approximating the Sparsest k-Subgraph in Chordal Graphs (Q3188867)

From MaRDI portal
Revision as of 22:08, 1 September 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Approximating the Sparsest k-Subgraph in Chordal Graphs
scientific article

    Statements

    Approximating the Sparsest k-Subgraph in Chordal Graphs (English)
    0 references
    0 references
    0 references
    0 references
    2 September 2014
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references