Results 71 to 80 of about 258,484 (338)

CciMST: A Clustering Algorithm Based on Minimum Spanning Tree and Cluster Centers

Mathematical Problems in Engineering, 2018
The minimum spanning tree- (MST-) based clustering method can identify clusters of arbitrary shape by removing inconsistent edges. The definition of the inconsistent edges is a major issue that has to be addressed in all MST-based clustering algorithms ...
Xiao-bo Lv, Yan Ma, Xiaofu He, Hui Huang, Jie Yang   +4 more
semanticscholar   +1 more source

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, Asier Agrelo‐Lestón, Ignasi Burgués‐Ceballos, Jordi Llorca, Lluís Soler   +4 more
wiley   +1 more source

A Resting-State Brain Functional Network Study in MDD Based on Minimum Spanning Tree Analysis and the Hierarchical Clustering

Complex, 2017
A large number of studies demonstrated that major depressive disorder (MDD) is characterized by the alterations in brain functional connections which is also identifiable during the brain’s “resting-state.” But, in the present study, the approach of ...
Xiaowei Li, Zhuang Jing, Bin Hu, Jing Zhu, Ning Zhong, Mi Li, Zhijie Ding, J. Yang, Lan Zhang, Lei Feng, D. Majoe   +10 more
semanticscholar   +1 more source

Efficient Maintenance of Minimum Spanning Trees in Dynamic Weighted Undirected Graphs

Mathematics
This paper presents an algorithm for effectively maintaining the minimum spanning tree in dynamic weighted undirected graphs. The algorithm efficiently updates the minimum spanning tree when the underlying graph structure changes.
Mao Luo, Huigang Qin, Xinyun Wu, Caiquan Xiong, Dahai Xia, Yuanzhi Ke   +5 more
doaj   +1 more source

Algorithms for the minimum spanning tree problem with resource allocation

Operations Research Perspectives, 2016
We formulate the minimum spanning tree problem with resource allocation (MSTRA) in two ways, as discrete and continuous optimization problems (d-MSTRA/c-MSTRA), prove these to be NP-hard, and present algorithms to solve these problems to optimality.
Seiji Kataoka, Takeo Yamada
doaj   +1 more source

Polynomial-Time Space-Optimal Silent Self-Stabilizing Minimum-Degree Spanning Tree Construction [PDF]

, 2014
Motivated by applications to sensor networks, as well as to many other areas, this paper studies the construction of minimum-degree spanning trees. We consider the classical node-register state model, with a weakly fair scheduler, and we present a space ...
Blin, Lélia, Fraigniaud, Pierre
core  

Wood Reconfiguration Enables Broadband Blackbody in Large‐Area, Modular, Optically Welded Carbon Constructs

Advanced Functional Materials, EarlyView.
Wood‐based broadband blackbody is achieved by reconfiguration of wood with lignin nanoparticles prior carbonization. Neglectable reflectivity from the visible to infrared wavelengths is obtained by combining thin nanostructures originated from the wood cell walls with long‐range microcavities in the wood lumina.
Bin Zhao, Noora Jäntti, Alexey Khakalo, Ulla Holopainen‐Mantila, Wenyang Xu, Jaana Vapaavuori, Orlando J. Rojas, Bruno D. Mattos   +7 more
wiley   +1 more source

Robust and minimum spanning tree in fuzzy environment

International Journal of Computing Science and Mathematics, 2019
This paper proposes an algorithm to find the fuzzy minimum spanning tree (FMST) of an undirected weighted fuzzy graph, in which mixed fuzzy numbers, either triangular or trapezoidal, are used to represent the lengths/costs of the arcs.
Arindam Dey, Sahanur Mondal, T. Pal
semanticscholar   +1 more source

The Minimum Spanning Tree Problem on networks with Neutrosophic numbers [PDF]

Neutrosophic Sets and Systems
The minimum spanning tree problem (MSTP) revolves around creating a spanning tree (ST) within a graph/network that incurs the least cost compared to all other potential STs.
Kalyan Adhikary, Prashnatita Pal, Jayanta Poray   +2 more
doaj   +1 more source

Spanning trees with many leaves: new extremal results and an improved FPT algorithm [PDF]

, 2006
We present two lower bounds for the maximum number of leaves in a spanning tree of a graph. For connected graphs without triangles, with minimum degree at least three, we show that a spanning tree with at least (n+4)/3 leaves exists, where n is the ...
Bonsma, P.S.
core   +2 more sources