Results 11 to 20 of about 186,890 (225)
Packing coloring of hypercubes with extended Hamming codes [PDF]
, 2023 A {\em packing coloring} of a graph $G$ is a mapping assigning a positive integer (a color) to every vertex of $G$ such that every two vertices of color $k$ are at distance at least $k+1$.
Kranjc, Jaka +3 more
core +1 more source
Packing coloring of graphs [PDF]
, 2022 Pakirno barvanje grafe je dobro barvanje vozlišč, pri katerem sta poljubni dve vozlišči z isto barvo i na razdalji večji kot i. Pakirno kromatično število je najmanjše število barv, ki jih potrebujemo za tako barvanje grafa.
Ličina, Tomaž
core
Notes on complexity of packing coloring [PDF]
, 2018 A packing k-coloring for some integer k of a graph G = (V, E) is a mapping ϕ : V → {1, . . . , k} such that any two vertices u, v of color ϕ(u) = ϕ(v) are in distance at least ϕ(u) + 1. This concept is motivated by frequency assignment problems.
Bernard Lidický +7 more
core +1 more source
On The Packing k-Coloring of Unicyclic Graph Family [PDF]
, 2020 All graph in this paper is connected graph. Let du,v be a distance between any vertex u and v in graph GV,E. A function c :VG 1, 2, , k is called a packing k coloring if every two vertex of color i are at least distance i 1.
KRISTIANA, Arika Indah +2 more
core
On Weighted Bipartite Edge Coloring [PDF]
, 2015 We study weighted bipartite edge coloring problem, which is a generalization of two classical problems: bin packing and edge coloring. This problem has been inspired from the study of Clos networks in multirate switching environment in communication ...
Singh, Mohit, Khan, Arindam
core +1 more source
Online interval coloring with packing constraints
, 2008 We study online interval coloring problems with bandwidth. We are interested in some variants motivated by bin packing problems. Specifically we consider open-end coloring, cardinality constrained coloring, coloring with vector constraints and finally a ...
Epstein, Leah, Levy, Meital
core +1 more source
FEBS Letters, EarlyView.Ascidian Ciona larvae initially show strong clockwise tail twisting, which is largely corrected during development. However, a small residual twist remains. This study shows that organized helical myofibrils in tail muscles mechanically stabilize this residual asymmetry, preventing complete restoration of bilateral symmetry and revealing how embryos ...
Yuki S. Kogure +3 more
wiley +1 more source
Efficient derandomization of the Lovász Local Lemma and applications to coloring and packing problems [PDF]
, 2003 We use algorithmic versions of Lovasz Local Lemma (LLL) to deal with the following two packing type problems: (i) a particular kind of hypergraph coloring problem, and (ii) vector packing problem.
Ahuja, Nitin
core +1 more source
Conserved binding mode but diverse interfaces of MreC‐PBP2 interactions
FEBS Letters, EarlyView.The crystal structure of abMreC reveals a conserved two β‐barrel architecture and provides structural insights into its role within the bacterial elongasome. The abMreC–abPBP2 complex model identifies the molecular basis of MreC‐mediated PBP2 recognition, contributing to the regulation of peptidoglycan synthesis.
Hyunseok Jang +4 more
wiley +1 more source
Quantum Algorithms for Graph Coloring and other Partitioning, Covering, and Packing Problems [PDF]
, 2023 Let U be a universe on n elements, let k be a positive integer, and let F be a family of (implicitly defined) subsets of U. We consider the problems of partitioning U into k sets from F, covering U with k sets from F, and packing k non-intersecting sets ...
Gaspers, Serge, Li, Jerry Zirui
core