Results 21 to 30 of about 24,121 (267)
On the Packing Partitioning Problem on Directed Graphs
Mathematics, 2021 This work is aimed to continue studying the packing sets of digraphs via the perspective of partitioning the vertex set of a digraph into packing sets (which can be interpreted as a type of vertex coloring of digraphs) and focused on finding the minimum ...
Babak Samadi, Ismael G. Yero
doaj +1 more source
Graphs that are Critical for the Packing Chromatic Number
Discussiones Mathematicae Graph Theory, 2022 Given a graph G, a coloring c : V (G) → {1, …, k} such that c(u) = c(v) = i implies that vertices u and v are at distance greater than i, is called a packing coloring of G.
Brešar Boštjan, Ferme Jasmina
doaj +1 more source
Coloring, packing and embedding of graphs
, 2012 Cette thèse se situe dans le domaine de graphes et de leurs applications, Elleest constitué de trois grandes parties, la première est consacrée à l’étude d’unnouveau type de coloration sommets distinguantes, les arête-colorations sommetsdistinguantespar écarte.
Mohammed Amin Tahraoui
openalex +3 more sources
On S-packing edge-coloring of graphs with given edge weight
Discussiones Mathematicae Graph TheoryJian Lu, Xiang-Feng Pan
doaj +2 more sources
On the Descriptive Complexity of Color Coding
Algorithms, 2021 Color coding is an algorithmic technique used in parameterized complexity theory to detect “small” structures inside graphs. The idea is to derandomize algorithms that first randomly color a graph and then search for an easily-detectable, small color ...
Max Bannach, Till Tantau
doaj +1 more source
Be3Ru: Polar Multiatomic Bonding in the Closest Packing of Atoms
ChemistryOpen, 2022 The new phase Be3Ru crystallizes with TiCu3‐type structure (space group Pmmn (59), a=3.7062(1) Å, b=4.5353(1) Å, c=4.4170(1) Å), a coloring variant of the hexagonal closest packing (hcp) of spheres.
Laura Agnarelli +7 more
doaj +1 more source
Compressed Subsequence Matching and Packed Tree Coloring [PDF]
Algorithmica, 2014 We present a new algorithm for subsequence matching in grammar compressed strings. Given a grammar of size $n$ compressing a string of size $N$ and a pattern string of size $m$ over an alphabet of size $ $, our algorithm uses $O(n+\frac{n }{w})$ space and $O(n+\frac{n }{w}+m\log N\log w\cdot occ)$ or $O(n+\frac{n }{w}\log w+m\log N\cdot occ)$ time.
Bille, Philip +2 more
openaire +5 more sources
Online Colored Bin Packing [PDF]
, 2015 Comment: Added lower bound of 2.5 for at least three colors, expanded some ...
Böhm, Martin +2 more
openaire +3 more sources
Online Interval Coloring with Packing Constraints [PDF]
Theoretical Computer Science, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Epstein, Leah, Levy, Meital
openaire +2 more sources
S-Packing Colorings of Cubic Graphs [PDF]
, 2016 Given a non-decreasing sequence $S=(s\_1,s\_2, \ldots, s\_k)$ of positive integers, an {\em $S$-packing coloring} of a graph $G$ is a mapping $c$ from $V(G)$ to $\{s\_1,s\_2, \ldots, s\_k\}$ such that any two vertices with color $s\_i$ are at mutual ...
Gastineau, Nicolas, Togni, Olivier
core +2 more sources