Towards a polynomial equivalence between \k\-packing functions and k-limited packings in graphs
DOI10.1007/978-3-319-45587-7_14zbMATH Open1445.68170OpenAlexW2516984173MaRDI QIDQ2835672FDOQ2835672
Authors: V. Leoni, M. P. Dobson 
Publication date: 30 November 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-45587-7_14
Recommendations
- $$\{k\}$$-Packing Functions of Graphs
- NP-completeness of the \(\{k \}\)-packing function problem in graphs
- On the complexity of the {\(k\)}-packing function problem
- Labelled packing functions in graphs
- The \(k\)-limited packing and \(k\)-tuple domination problems in strongly chordal, \(P_{4}\)-tidy and split graphs
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- The multiple domination and limited packing problems in graphs
- The \(k\)-limited packing and \(k\)-tuple domination problems in strongly chordal, \(P_{4}\)-tidy and split graphs
- $$\{k\}$$-Packing Functions of Graphs
- NP-completeness of the \(\{k \}\)-packing function problem in graphs
- Exploring the complexity boundary between coloring and list-coloring
- Limited Packings in Graphs
- On the complexity of the {\(k\)}-packing function problem
Cited In (5)
This page was built for publication: Towards a polynomial equivalence between \(\{k\}\)-packing functions and \(k\)-limited packings in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2835672)
