Results 161 to 170 of about 18,582 (315)

Geodesic Dominated Coloring of Graphs

IEEE Access
In this paper, we introduce geodesic dominated coloring, a novel variant of dominated coloring in graphs, where each color class is dominated by at least one geodesic.
M. Paruvatha Vathana, R. Jayagopal
doaj   +1 more source

Effective and Efficient Dynamic Graph Coloring

, 2017
Graph coloring is a fundamental graph problem that is widely applied in a variety of applications. The aim of graph coloring is to minimize the number of colors used to color the vertices in a graph such that no two incident vertices have the same color.
Qin, L, Zhang, W, Yuan, L, Xuemin Lin, Lijun Chang, Lin, X, Chang, L, Long Yuan, Wenjie Zhang, Lu Qin   +9 more
core   +1 more source

Tailoring Functional Properties of Ti–Ni–Cu Shape Memory Alloy Thin Films for MEMS Actuators

Advanced Engineering Materials, EarlyView.
A comprehensive study of critical parameters required to develop well‐performing Ti–Ni–Cu thin film shape memory alloy microactuators is provided. Materials science and device integration aspects are integrated by addressing structural and physical relationships using complementary characterization techniques as well as a practical fabrication solution
Elaheh Akbarnejad, Aleksander Kostka, Gowtham Arivanandhan, Yujiao Li, Alan Savan, Manfred Kohl, Alfred Ludwig   +6 more
wiley   +1 more source

Extensions and variations of the two-person game on graphs

, 2011
Khachatryan A. Extensions and variations of the two-person game on graphs.
Khachatryan, Anush
core  

PASTA‐ELN: Simplifying Research Data Management for Experimental Materials Science

Advanced Engineering Materials, EarlyView.
Research data management faces ongoing hurdles as many ELNs remain complex and restrictive. PASTA‐ELN offers an open‐source, cross‐platform solution that prioritizes simplicity, offline access, and user control. Its in tuitive folder structure, modular Python add‐ons, and open formats enable seamless documentation, FAIR data practices, and easy ...
S. Brinckmann, G. Winkens, R. Schwaiger
wiley   +1 more source

Parallel graph coloring : Parallel graph coloring on multi-core CPUs

, 2014
In recent times an evident trend in hardware is to opt for multi-core CPUs. This has lead to a situation where an increasing number of sequential algorithms are parallelized to fit these new multi-core environments. The greedy Multi-Coloring algorithm is
Normann, Per
core  

Frozen development in graph coloring

, 2001
We define the ‘frozen development’ of coloring random graphs. We identify two nodes in a graph as frozen if they are of the same color in all legal colorings and define the collapsed graph as the one in which all frozen pairs are merged.
Gent, Ian, Ian Gent, Culberson, J, Culberson, Joseph, Gent, I, Joseph Culberson   +5 more
core   +1 more source

Recycling of NiTi Shape Memory Alloys: Fundamental and Technological Aspects of a Vacuum Induction Melting Processing Route

Advanced Engineering Materials, EarlyView.
The present study investigates recycling of NiTi shape memory alloys via vacuum induction melting. An ingot was synthesized from elemental Ni and Ti and subjected to three subsequent remelting cycles. Remelting increases process durations and impurity levels and adversely affects microstructures and functional properties.
Sakia Sophia Noorzayee, Son Tung Mai, Sarath Menon, Braulio Gadiel Sánchez Ortega, Ralf Drautz, Alexander Kauffmann, Gunther Eggeler, Jan Frenzel   +7 more
wiley   +1 more source

Neural algorithmic reasoning for approximate -coloring with recursive warm starts

Machine Learning: Science and Technology
Node coloring is the task of assigning colors to the nodes of a graph such that no two adjacent nodes have the same color, while using as few colors as possible.
Knut Vanderbush, Melanie Weber
doaj   +1 more source

Evaluating Graph Coloring on GPUs

, 2014
This paper evaluates features of graph coloring algorithms implemented on graphics processing units (GPUs), comparing coloring heuristics and thread decompositions.

core