Towards a Polynomial Equivalence Between $$\{k\}$$ -Packing Functions and k-Limited Packings in Graphs (Q2835672): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:16, 3 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
30 November 2016
0 references
computational complexity
0 references
F-free graph
0 references
bipartite graph
0 references
