Approximating Maximum Subgraphs without Short Cycles (Q5894186)

From MaRDI portal
Revision as of 09:36, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5866205
Language Label Description Also known as
English
Approximating Maximum Subgraphs without Short Cycles
scientific article; zbMATH DE number 5866205

    Statements

    Approximating Maximum Subgraphs without Short Cycles (English)
    0 references
    0 references
    0 references
    0 references
    15 March 2011
    0 references
    cycles of length \(k\)
    0 references
    approximation
    0 references
    girth
    0 references
    packing
    0 references
    LP
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references