Results 111 to 120 of about 2,238,100 (388)
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
Spanning tree generating functions and Mahler measures
, 2012 We define the notion of a spanning tree generating function (STGF) $\sum a_n z^n$, which gives the spanning tree constant when evaluated at $z=1,$ and gives the lattice Green function (LGF) when differentiated.
Anthony J Guttmann +28 more
core +1 more source
Advanced Functional Materials, EarlyView.The versatile precursor‐assisted soft sphere close packing during slot‐die coating is investigated with in situ X‐ray scattering. The soft crystallization pathways towards a close packing involve multistep structural transitions such as surface nucleation, in‐plane, and out‐of‐plane crystallization.
Guangjiu Pan +14 more
wiley +1 more source
Polynomial Time Approximation Schemes for the Constrained Minimum Spanning Tree Problem
Journal of Applied Mathematics, 2012 Let G=(V,E) be an undirected graph with a weight function and a cost function on edges. The constrained minimum spanning tree problem is to find a minimum cost spanning tree T in G such that the total weight in T is at most a given bound B. In this paper,
Yen Hung Chen
doaj +1 more source
The generalized minimum spanning tree polytope and related polytopes [PDF]
, 2001 The Generalized Minimum Spanning Tree problem denoted by GMST is a variant of the classical Minimum Spanning Tree problem in which nodes are partitioned into clusters and the problem calls for a minimum cost tree spanning at least one node from each ...
Pop, P.C.
core +1 more source
, 2018 Given an undirected connected graph $G(V, E)$, constructing a spanning tree is a well studied problem with polynomial time algorithms. If we restrict the spanning tree to be "regular" as defined below, it turns out that this becomes a very hard problem.
openaire +2 more sources
Bimetallic Nanoparticles as Cocatalysts for Photocatalytic Hydrogen Production
Advanced Functional Materials, EarlyView.Recent developments have introduced bimetallic nanoparticles as effective cocatalysts for photocatalytic systems. This review explores the rapidly expanding research on bimetallic cocatalysts for photocatalytic production of hydrogen, emphasizing the creation of carrier‐selective contacts, localized surface plasmon resonance effects, methodologies for ...
Yufen Chen +4 more
wiley +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
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
A distributed spanning tree algorithm
DAIMI Report Series, 1987 We present a distributed algorithm for constructing a spanning tree for connected undirected graphs. Nodes correspond to processors and edges correspond to two-way channels. Each processor has initially a distinct identity and all processors perform the same algorithm. Computation as well as communication is asynchronous.
Johansen, Karl Erik +4 more
openaire +4 more sources