Results 91 to 100 of about 186,232 (291)
Aksioma: Jurnal Program Studi Pendidikan Matematika, 2012 One of useful graph theory to solve the real problems is Minimum Spanning Tree (MST). MST is network optimization problems that can be applied in many fields such as transportations problems and communication network design (Gruber and Raidl, 2005).
Swaditya Rizki
doaj +1 more source
Spin‐Split Edge States in Metal‐Supported Graphene Nanoislands Obtained by CVD
Advanced Materials, EarlyView.Combining STM measurements and ab‐initio calculations, we show that zig‐zag edges in graphene nanoislands grown on Ni(111) by CVD retrieve their spin‐polarized edge states after intercalation of a few monolayers of Au. ABSTRACT Spin‐split states localized on zigzag edges have been predicted for different free‐standing graphene nanostructures.
Michele Gastaldo +6 more
wiley +1 more source
Atomistic Mechanisms Triggered by Joule Heating Effects in Metallic Cu‐Bi Nanowires for Spintronics
Advanced Materials, EarlyView.Bi doped metallic Cu nanowires are promising for spintronics thanks to the stabilization of a giant spin Hall effect. However, heat resulting from current injection forces Bi to leave solution, forcing segregation into monoatomic decorations which evolve into coherent crystalline aggregates.
Alejandra Guedeja‐Marrón +6 more
wiley +1 more source
Infinity Jurnal Matematika dan Aplikasinya, 2020 Penelitian ini bertujuan untuk menentukan pohon merentang minimum (Minimum Spanning Tree) terhadap lintasan yang mengarah ke Pusat Perbelanjaan di Kota Palopo menggunakan Algoritma Semut.
Fatimah Fatimah, Marwan Sam
doaj
Aksioma: Jurnal Program Studi Pendidikan Matematika, 2018 This study aims to determine the minimum spanning tree of a complete graph K_n with weight constraints and completion using the cutting plane method. The cutting plane method is one of the algorithms included in the exact method.
Dewi Suhika, Wamiliana Wamiliana
doaj +1 more source
An approximate solution method based on tabu search for k-minimum spanning tree problems [PDF]
, 2008 This paper considers k-minimum spanning tree problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving procedure of minimum spanning tree (MST) problems for subgraphs to obtain a ...
Hayashida, Tomohiro +3 more
core
3D‐Printable, Honeycomb‐Inspired Tissue‐Like Bioelectrodes for Patient‐Specific Neural Interface
Advanced Materials, EarlyView.3D printed MRI‐compatible tissue‐like neural electrodes tailored to individual gyral patterns. This honeycomb‐inspired printable gel electrode (HiPGE) employs a bioinspired architecture with soft hydrogels, engineered to match the softness of brain tissue.
Marzia Momin +12 more
wiley +1 more source
Minimum Diameter Spanning Tree
American Journal of Computational Mathematics, 2018 In this paper, we discuss the simple connected graphs which have a minimum diameter spanning tree such that both have same domination number.
V. T. Chandrasekaran, N. Rajasri
openaire +2 more sources
Polymorph‐Specific Electronic Transduction in WO3 during Molecular Sensing
Advanced Materials, EarlyView.Metal‐oxide polymorphs with similar surface chemistry can nevertheless exhibit distinct sensing properties. In γ‐ and ε‐WO3, analyte adsorption appears comparable; yet, only ε‐WO3 induces a pronounced lattice electronic perturbation that accommodates charge in sub‐conduction band minimum states.
Matteo D'Andria +6 more
wiley +1 more source
Solving the Minimum Spanning Tree Problem Under Interval-Valued Fermatean Neutrosophic Domain [PDF]
Neutrosophic Sets and SystemsIn classical graph theory, the minimal spanning tree (MST) is a subgraph that lacks cycles and efficiently connects every vertex by utilizing edges with the minimum weights.
Souhail Dhouib +3 more
doaj +1 more source