Pages that link to "Item:Q2968508"
From MaRDI portal
The following pages link to On the complexity of the {<i>k</i>}-packing function problem (Q2968508):
Displaying 7 items.
- NP-completeness of the \(\{k \}\)-packing function problem in graphs (Q324745) (← links)
- Complexity results for the horizontal bar packing problem (Q975490) (← links)
- Universal maximal packing functions of graphs (Q1126177) (← links)
- Labelled packing functions in graphs (Q2011027) (← links)
- Towards a Polynomial Equivalence Between $$\{k\}$$ -Packing Functions and k-Limited Packings in Graphs (Q2835672) (← links)
- Denser packings obtained in \(O(n \log \log n)\) time (Q2892352) (← links)
- (Q3818327) (← links)