Results 81 to 90 of about 309,634 (292)
Minimum Spanning Tree for the Implementation of Kruskal’s Algorithm
IJID (International Journal on Informatics for Development), 2014 Kruskal’s algorithm is an algorithm used to find a minimum spanning tree in graph connectivity which gives an option to keep processing the edge limit with the least weight.
Paryati Paryati, Ahmad Subhan Yazid
doaj +1 more source
Spanning trees with small diameters
AKCE International Journal of Graphs and Combinatorics, 2020 A spanning tree with small diameter of a graph has many applications. In this paper we first make the following conjecture and show that the condition is best possible if it is true. If a connected graph satisfies , then has a spanning tree with diameter
Mikio Kano, Hajime Matsumura
doaj +1 more source
Minimum Restricted Diameter Spanning Trees
Discrete Applied Mathematics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hassin, Refael, Levin, Asaf
openaire +1 more source
Advanced Functional Materials, EarlyView.A novel approach for the design of functional semiconductors is presented, which utilizes the excellent optoelectronic properties of layered hybrid perovskites and the possibility to introduce a molecular photoswitch as the organic spacer. This concept is successfully demonstrated on a coumarin‐based system with the possibility to change the bandgap ...
Oliver Treske +4 more
wiley +1 more source
A $2k$-Vertex Kernel for Maximum Internal Spanning Tree
, 2014 We consider the parameterized version of the maximum internal spanning tree problem, which, given an $n$-vertex graph and a parameter $k$, asks for a spanning tree with at least $k$ internal vertices. Fomin et al. [J. Comput. System Sci., 79:1-6] crafted
D Binkele-Raible +19 more
core +1 more source
Advanced Functional Materials, EarlyView.Permanent magnets derive their extraordinary strength from deep, universal electronic‐structure principles that control magnetization, anisotropy, and intrinsic performance. This work uncovers those governing rules, examines modern modeling and AI‐driven discovery methods, identifies critical bottlenecks, and reveals electronic fingerprints shared ...
Prashant Singh
wiley +1 more source
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
Universal Loop-Free Super-Stabilization [PDF]
, 2010 We propose an univesal scheme to design loop-free and super-stabilizing protocols for constructing spanning trees optimizing any tree metrics (not only those that are isomorphic to a shortest path tree). Our scheme combines a novel super-stabilizing loop-
Blin, Lélia +3 more
core +3 more sources
Meta‐Rod Mechanical Metamaterials With Programmable Reconfiguration
Advanced Functional Materials, EarlyView.Existing mechanical metamaterials achieve programmable large deformations in planar square or cubic configurations, restricted by required complex boundary conditions. This research proposes a 1D metamaterial, Meta‐rod, with linear, bending, twisting, area, and volume deformation modes.
Atharva Pande, Lyes Kadem, Hang Xu
wiley +1 more source
Invasion percolation and global optimization
, 1996 Invasion bond percolation (IBP) is mapped exactly into Prim's algorithm for finding the shortest spanning tree of a weighted random graph. Exploring this mapping, which is valid for arbitrary dimensions and lattices, we introduce a new IBP model that ...
Barabás, Albert-László
core +1 more source