Results 41 to 50 of about 34,319 (321)
RECYCLING SOLUTIONS FOR VERTEX COLORING HEURISTICS
Journal of the Operations Research Society of Japan, 2021 The vertex coloring problem is a well-known NP-hard problem and has many applications in operations research and in scheduling. A conventional approach to the problem solves the k-colorability problem iteratively, decreasing k one by one. Whether a heuristic algorithm finds a legal k-coloring quickly or not is largely affected by an initial solution ...
Uchida, Yasutaka +2 more
openaire +3 more sources
Vertex coloring of plane graphs with nonrepetitive boundary paths
, 2011 A sequence $s_1,s_2,...,s_k,s_1,s_2,...,s_k$ is a repetition. A sequence $S$ is nonrepetitive, if no subsequence of consecutive terms of $S$ form a repetition. Let $G$ be a vertex colored graph.
Alon +12 more
core +1 more source
On Twin Edge Colorings of Graphs
Discussiones Mathematicae Graph Theory, 2014 A twin edge k-coloring of a graph G is a proper edge coloring of G with the elements of Zk so that the induced vertex coloring in which the color of a vertex v in G is the sum (in Zk) of the colors of the edges incident with v is a proper vertex coloring.
Andrews Eric +4 more
doaj +1 more source
Finding and Counting Vertex-Colored Subtrees [PDF]
Algorithmica, 2010 Conference version in International Symposium on Mathematical Foundations of Computer Science (MFCS), Brno : Czech Republic (2010) Journal Version in ...
Guillemot, Sylvain, Sikora, Florian
openaire +4 more sources
Diffusion Tractography Biomarker for Epilepsy Severity in Children With Drug‐Resistant Epilepsy
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective To develop a novel deep‐learning model of clinical DWI tractography that can accurately predict the general assessment of epilepsy severity (GASE) in pediatric drug‐resistant epilepsy (DRE) and test if it can screen diverse neurocognitive impairments identified through neuropsychological assessments.
Jeong‐Won Jeong +7 more
wiley +1 more source
Inclusive Local Irregularity Vertex Coloring In Grid Graph Family
Cauchy: Jurnal Matematika Murni dan AplikasiLet is a simple graph and connected where is vertex set and is edge set. A maping as vertex k- labeling and function : is inclusive local irregularity vertex coloring, with .
Arika Indah Kristiana +5 more
doaj +1 more source
Upper and lower bounds based on linear programming for the b-coloring problem
EURO Journal on Computational Optimization, 2022 B-coloring is a problem in graph theory. It can model some real applications, as well as being used to enhance solution methods for the classical graph coloring problem. In turn, improved solutions for the classical coloring problem would impact a larger
Roberto Montemanni +2 more
doaj +1 more source
Functional Connectivity Linked to Cognitive Recovery After Minor Stroke
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Patients with minor stroke exhibit slowed processing speed and generalized alterations in functional connectivity involving frontoparietal cortex (FPC). The pattern of connectivity evolves over time. In this study, we examine the relationship of functional connectivity patterns to cognitive performance, to determine ...
Vrishab Commuri +7 more
wiley +1 more source
Interval total colorings of graphs
, 2003 A total coloring of a graph $G$ is a coloring of its vertices and edges such that no adjacent vertices, edges, and no incident vertices and edges obtain the same color.
A Prouté +17 more
core +3 more sources
Animation Visualization for Vertex Coloring of Polyhedral Graphs [PDF]
Journal of Systemics, Cybernetics and Informatics, 2013 Vertex coloring of a graph is the assignment of labels to the vertices of the graph so that adjacent vertices have different labels. In the case of polyhedral graphs, the chromatic number is 2, 3, or 4. Edge coloring problem and face coloring problem can
Hidetoshi Nonaka
doaj