Results 251 to 260 of about 24,121 (267)
Some of the next articles are maybe not open access.
1987
Abstract Let H be a family of t-sets on {l,2, …, k }. A family of k-sets on v elements is called a (v, k, ϰ)-packing if for all F ∈ there is a copy of ϰ, ϰ F such that the t-sets of F corresponding to H F are covered only by F.
P. Frankl, Z. Füredi
openaire +1 more source
Abstract Let H be a family of t-sets on {l,2, …, k }. A family of k-sets on v elements is called a (v, k, ϰ)-packing if for all F ∈ there is a copy of ϰ, ϰ F such that the t-sets of F corresponding to H F are covered only by F.
P. Frankl, Z. Füredi
openaire +1 more source
Packing random items of three colors
Combinatorica, 1992zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rhee, Wansoo T., Talagrand, Michel
openaire +1 more source
Packing Densities of Colored and Non-Colored Patterns
GS4 Student Scholars Symposium 2015, 2015Pattern packing concerns finding an optimal permutation that contains the maximum number of occurrences of a given pattern and computing the corresponding packing density. In many instances such an optimal permutation can be characterized directly and the number of occurrences of the pattern in interest may be enumerated explicitly. In more complicated
openaire +1 more source
Colored Bin Packing: Online Algorithms and Lower Bounds
Algorithmica, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Böhm, Martin +4 more
openaire +1 more source
Algebraic and Combinatorial Algorithms for S-Packing Coloring
ACM Communications in Computer AlgebraS -packing coloring is a generalization of proper coloring of graphs, introduced more than a decade ago. In this paper, we present algebraic and combinatorial algorithms for the problem of S -packing coloring of finite undirected and unweighted graphs. We assess the upper bounds for the complexity of our
Harith, K. Mohamed +2 more
openaire +2 more sources
Covering, Coloring, and Packing Hypergraphs
2017A hypergraph \(\mathcal {H}=(\mathcal V,\mathcal E)\) consists of a (finite) vertex set \(\mathcal V\) and a set of hyper-edges \(\mathcal E\), where each edge \(E\in \mathcal E\) is a subset of \(E\subset \mathcal V\). The vertices will usually be labelled by \(\mathcal V=(v_1,\dots ,v_I)\), the edges by \(\mathcal E=(E_1,\dots ,E_J)\), where \(I,J\in
openaire +1 more source
On the packing coloring of base-3 Sierpiński graphs and H-graphs
Aequationes Mathematicae, 2020Fei Deng, Zehui Shao, Aleksander Vesel
exaly
Complexity of the packing coloring problem for trees
Discrete Applied Mathematics, 2010Petr A Golovach
exaly
Notes on complexity of packing coloring
Information Processing Letters, 2018Bernard Lidický +2 more
exaly