Results 111 to 120 of about 248,790 (377)

Minimum Cost Spanning Tree Games and Population Monotonic Allocation Schemes [PDF]

open access: yes
In this paper we present the Subtraction Algorithm that computes for every classical minimum cost spanning tree game a population monotonic allocation scheme.As a basis for this algorithm serves a decomposition theorem that shows that every minimum cost ...
Moretti, S., Norde, H.W., Tijs, S.H.
core   +1 more source

Scalable Lithium Niobate Nanoimprinting for Nonlinear Metalenses

open access: yesAdvanced Materials, EarlyView.
A broadband polycrystalline lithium niobate platform is developed for highly versatile and scalable fabrication of nonlinear metasurfaces. This work demonstrates simultaneous second harmonic generation and wavefront‐shaping via a metalens on this platform.
Ülle‐Linda Talts   +3 more
wiley   +1 more source

Minimum Diameter Spanning Tree

open access: yesAmerican 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.
N. Rajasri, V. T. Chandrasekaran
openaire   +3 more sources

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

open access: yes, 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  

Topology in Biological Piezoelectric Materials

open access: yesAdvanced Materials, EarlyView.
This review summarizes the topological structures in biological piezoelectric materials, covering morphology evolution, spatial arrangement, and biomimetic strategies. These topologies modulate structure‐property relationships across multiple scales, enabling performance enhancement and multifunctional integration.
Chen Chen   +7 more
wiley   +1 more source

Aplikasi Algoritma Semut Dalam Menentukan Pohon Merentang Minimum (Minimum Spanning Tree) Terhadap Lintasan yang Mengarah ke Pusat Perbelanjaan di Kota Palopo

open access: yesInfinity 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  

On the irreducible core and the equal remaining obligations rule of minimum cost spanning extension problems [PDF]

open access: yes
Minimum cost spanning extension problems are generalizations of minimum cost spanning tree problems in which an existing network has to be extended to connect users to a source.
Feltkamp, V., Muto, S., Tijs, S.H.
core   +1 more source

Polyanhydride‐Based Microparticles for Programmable Pulsatile Release of Diphtheria Toxoid (DT) for Single‐Injection Self‐Boosting Vaccines

open access: yesAdvanced Materials, EarlyView.
This study presents a polyanhydride‐based delivery platform for single‐injection, self‐boosting vaccines. The system enables programmable, pulsatile release of diphtheria toxoid with high antigen recovery and is guided by machine learning for tunability. In vivo results show immune responses comparable to multi‐dose regimens, highlighting its potential
Linzixuan Zhang   +17 more
wiley   +1 more source

PENGGUNAAN METODE CUTTING PLANE UNTUK MENYELESAIKAN MINIMUM SPANNING TREE DENGAN KENDALA BOBOT PADA GRAF K_n

open access: yesAksioma: 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

A Vertex Oriented Approach to Minimum Cost Spanning Tree Problems [PDF]

open access: yes
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

Home - About - Disclaimer - Privacy