Results 151 to 160 of about 258,484 (338)
An approximation algorithm for the at least version of the generalized minimum spanning tree problem
Journal of Numerical Analysis and Approximation Theory, 2006 We consider the at least version of the Generalized Minimum Spanning Tree Problem, denoted by L-GMSTP, which consists in finding a minimum cost tree spanning at least one node from each node set of a complete graph with the nodes partitioned into a ...
Petrică C. Pop +2 more
doaj +2 more sources
A Vertex Oriented Approach to Minimum Cost Spanning Tree Problems [PDF]
In this paper we consider spanning tree problems, where n players want to be connected to a source as cheap as possible. We introduce and analyze (n!) vertex oriented construct and charge procedures for such spanning tree situations leading in n steps to
Ciftci, B.B., Tijs, S.H.
core +1 more source
Spatiotemporal Free-Form Registration Method Assisted by a Minimum Spanning Tree During Discontinuous Transformations. [PDF]
J Digit Imaging, 2021 Bae JP, Yoon S, Vania M, Lee D.
europepmc +1 more source
Advanced Materials, EarlyView.An ideal implant should mimic native tissues such that it can integrate, sense, heal, and continue to function, i.e., be autonomous. Although early, there are good steps taken in this way, e.g., the development of stimuli‐responsive, self‐powering, self‐actuating, self‐healing, self‐regenerating, and self‐aware implants.
Jagan Mohan Dodda +5 more
wiley +1 more source
Advanced Materials, EarlyView.Metal‐free carbon catalysts enable the sustainable synthesis of hydrogen peroxide via two‐electron oxygen reduction; however, active site complexity continues to hinder reliable interpretation. This review critiques correlation‐based approaches and highlights the importance of orthogonal experimental designs, standardized catalyst passports ...
Dayu Zhu +3 more
wiley +1 more source
No advantageous merging in minimum cost spanning tree problems [PDF]
In the context of cost sharing in minimum cost spanning tree problems, we introduce a property called No Advantageous Merging. This property implies that no group of agents can be better off claiming to be a single node.
Gomez-Rua, Maria, Vidal-Puga, Juan
core +1 more source
Advanced Materials, EarlyView.Lithography‐guided intercalation creates a proximitized 2D superconducting Ga layer under graphene Hall bars via liquid‐metal intercalation. The image shows a Hall bar where Ga atoms from the liquid phase enter through patterned intercalation channels beneath quasi‐freestanding bilayer graphene, forming a confined 2D metal that demonstrates ...
Stefan Wundrack +18 more
wiley +1 more source
The Bird Core for Minimum Cost Spanning Tree problems Revisited: Monotonicity and Additivity Aspects [PDF]
A new way is presented to define for minimum cost spanning tree (mcst-) games the irreducible core, which is introduced by Bird in 1976.The Bird core correspondence turns out to have interesting monotonicity and additivity properties and each stable cost
Brânzei, R. +3 more
core +1 more source
Advanced Materials, EarlyView.2D α‐Co(OH)2 interleaved with Mo species displays an appealing dual functionality for the production and use of green hydrogen.Mo incorporation greatly benefits the electrochemical behaviour in Oxygen Evolution Reaction for H2 production, while the magnetocaloric response at liquid H2 temperature paves the way for alternative cryogenic refrigerants ...
Daniel Muñoz‐Gil +14 more
wiley +1 more source
Perturbation Algorithm for a Minimax Regret Minimum Spanning Tree Problem
Operations Research and Decisions, 2014 The problem of finding a robust spanning tree has been analysed. The problem consists of determining a minimum spanning tree of a graph with uncertain edge costs. We should determine a spanning tree that minimizes the difference in costs between the tree
Mariusz Makuchowski
doaj