Towards a polynomial equivalence between {k}-packing functions and k-limited packings in graphs
Artículo
Material complementario disponible
Artículo
CONICET Digital
Given a positive integer k, the {k}-packing function problem ({k}PF) is to find in a given graph G, a function f of maximum weight that assigns a non-negative integer to the vertices of G in such a way that the sum of f(...
Idioma eng
Material complementario disponibleEl enlace apunta a material asociado, anexos, tablas, datos o página complementaria. No se marca como libro/texto completo.
Material complementario