Towards a Polynomial Equivalence Between $$\{k\}$$ -Packing Functions and k-Limited Packings in Graphs (Q2835672): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q845911
Property / author
 
Property / author: Maria Patricia Dobson / rank
Normal rank
 

Revision as of 05:58, 21 February 2024

scientific article
Language Label Description Also known as
English
Towards a Polynomial Equivalence Between $$\{k\}$$ -Packing Functions and k-Limited Packings in Graphs
scientific article

    Statements

    Towards a Polynomial Equivalence Between $$\{k\}$$ -Packing Functions and k-Limited Packings in Graphs (English)
    0 references
    0 references
    30 November 2016
    0 references
    computational complexity
    0 references
    F-free graph
    0 references
    bipartite graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references