Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs (Q2938098)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs
scientific article

    Statements

    Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 January 2015
    0 references

    Identifiers