NP-completeness of the \k \-packing function problem in graphs
From MaRDI portal
Publication:324745
Recommendations
Cites work
- scientific article; zbMATH DE number 2061538 (Why is no real title available?)
- scientific article; zbMATH DE number 3453634 (Why is no real title available?)
- $$\{k\}$$-Packing Functions of Graphs
- Limited packings in graphs
- Reducibility among combinatorial problems
- The \(k\)-limited packing and \(k\)-tuple domination problems in strongly chordal, \(P_{4}\)-tidy and split graphs
- The algorithmic use of hypertree structure and maximum neighbourhood orderings
- The multiple domination and limited packing problems in graphs
Cited in
(5)- $$\{k\}$$-Packing Functions of Graphs
- Labelled packing functions in graphs
- On the complexity of the {\(k\)}-packing function problem
- scientific article; zbMATH DE number 759647 (Why is no real title available?)
- Towards a polynomial equivalence between \(\{k\}\)-packing functions and \(k\)-limited packings in graphs
This page was built for publication: NP-completeness of the \(\{k \}\)-packing function problem in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324745)