Finding socially best spanning trees
Socially best spanning tree, Social choice, Ranking spanning trees,
Andreas Darmann +2 more
core +1 more source
An Ever Closer Union? Examining The Evolution Of The Integration Of European Equity Markets Via Minimum Spanning Trees [PDF]
The concept of a minimum spanning tree (MST) is used to study the process of comovements for 21 European Union stock market indices. We show how the asset tree and its related hierarchical tree evolve over time and describe the dynamics.
Marian Boscia +2 more
core
Random spanning trees on homogeneous graphs [PDF]
Doctor of PhilosophyDepartment of MathematicsPietro Poggi-CorradiniSpanning trees have been studied as combinatorial objects for a long time. However, they have found great use in other disciplines recently. Disjoint spanning trees are important in fault-
Melikyan, Anna
core
Knowledge Structure and Evolution of Global Ancient Tree Research: A Visual Exploration Based on CiteSpace. [PDF]
Plants (Basel)Xu C, Chang Y, Li B, Zhong Q, Zhang S.
europepmc +1 more source
An Approximation Scheme for the Generalized Geometric Minimum Spanning Tree Problem with Grid Clustering [PDF]
This paper is concerned with a special case of the Generalized Minimum Spanning Tree Problem. The Generalized Minimum Spanning Tree Problem is de¯ned on an undirected graph, where the vertex set is partitioned into clusters, and non-negative costs are ...
Grigoriev,Alexander, Feremans,Corinne
core
Hierarchy Aware CT-Driven Constrained Constructive Optimization: A Framework for Coronary Network Generation. [PDF]
Ann Biomed EngVajire SL, Choy JS, Kassab GS, Lee LC.
europepmc +1 more source
Long-Read Evidence for Repeat-Associated Structural Heterogeneity in the Mitochondrial Genome of <i>Rhododendron spinuliferum</i>. [PDF]
Genes (Basel)Chen J, Feng Y, Qian X, Zhang D.
europepmc +1 more source
A Probabilistic Tabu Search Algorithm for the Generalized Minimum Spanning Tree Problem [PDF]
In this paper we present a probabilistic tabu search algorithm for the generalized minimum spanning tree problem. The basic idea behind the algorithm is to use preprocessing operations to arrive at a probability value for each vertex which roughly ...
Ghosh, Diptesh
core
Generalizing the Gaussian Network Model: Spanning-Tree Thermodynamics Shows Entropy-Driven KRAS Activation. [PDF]
ProteinsCiftci FS, Erman B.
europepmc +1 more source
Tree-Packing Revisited: Faster Fully Dynamic Min-Cut and Arboricity. [PDF]
Algorithmicade Vos T, Christiansen A.
europepmc +1 more source