Polyhedral results, branch-and-cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem
Sign Up to like & getrecommendations! Published in 2018 at "Networks"
DOI: 10.1002/net.21787
Abstract: Given a complete and undirected graph G, the adjacent only quadratic minimum spanning tree problem (AQMSTP) consists of finding a spanning tree that minimizes a quadratic function of its adjacent edges. The strongest AQMSTP linear… read more here.
Keywords: branch cut; lagrangian relaxation; adjacent quadratic; problem ... See more keywords
Rainbow and Properly Colored Spanning Trees in Edge-Colored Bipartite Graphs
Sign Up to like & getrecommendations! Published in 2021 at "Graphs and Combinatorics"
DOI: 10.1007/s00373-021-02334-5
Abstract: An edge-colored graph is called rainbow (or heterochromatic) if all its edges have distinct colors. It is known that if an edge-colored connected graph H has minimum color degree at least |H|/2 and has a… read more here.
Keywords: color degree; minimum color; colored spanning; properly colored ... See more keywords
A minimum spanning tree based partitioning and merging technique for clustering heterogeneous data sets
Sign Up to like & getrecommendations! Published in 2020 at "Journal of Intelligent Information Systems"
DOI: 10.1007/s10844-020-00602-z
Abstract: Clustering being an unsupervised learning technique, has been used extensively for knowledge discovery due to its less dependency on domain knowledge. Many clustering techniques were proposed in the literature to recognize the cluster of different… read more here.
Keywords: technique; merging technique; tree based; minimum spanning ... See more keywords
On the minimum routing cost clustered tree problem
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-016-0026-8
Abstract: For an edge-weighted graph $$G=(V,E,w)$$G=(V,E,w), in which the vertices are partitioned into k clusters $$\mathcal {R}=\{R_1,R_2,\ldots ,R_k\}$$R={R1,R2,…,Rk}, a spanning tree T of G is a clustered spanning tree if T can be cut into k… read more here.
Keywords: cost clustered; minimum routing; routing cost; cost ... See more keywords
A Bound on the Number of Leaves in a Spanning Tree of a Connected Graph of Minimum Degree 6
Sign Up to like & getrecommendations! Published in 2018 at "Journal of Mathematical Sciences"
DOI: 10.1007/s10958-018-4132-2
Abstract: We prove that a connected graph of minimum degree 6 has a spanning tree such that at least 1121$$ \frac{11\ }{21} $$ of its vertices are leaves. read more here.
Keywords: bound number; graph minimum; connected graph; minimum degree ... See more keywords
LT Codes and the Minimum Spanning Tree Based Distributed Storage in Wireless Sensor Networks
Sign Up to like & getrecommendations! Published in 2019 at "Mobile Networks and Applications"
DOI: 10.1007/s11036-018-1173-1
Abstract: In wireless sensor networks, sensor nodes are vulnerable due to the challenging environment and limited energy. Once a sensor node fails, the stored sensed data will be lost. In this paper, we develop a distributed… read more here.
Keywords: wireless sensor; minimum spanning; spanning tree; sensor networks ... See more keywords
Topology control in self-organized optical satellite networks based on minimum weight spanning tree
Sign Up to like & getrecommendations! Published in 2017 at "Aerospace Science and Technology"
DOI: 10.1016/j.ast.2017.07.003
Abstract: Abstract In this paper, we first propose a distributed minimum spanning tree (DMST) algorithm for optical satellite networks (OSNs). The OSNs are characterized by high dynamic topology, long-distance beam, directional links and supported up to… read more here.
Keywords: satellite networks; minimum weight; topology; optical satellite ... See more keywords
Event-triggered exponential synchronization of complex dynamical networks with cooperatively directed spanning tree topology
Sign Up to like & getrecommendations! Published in 2019 at "Neurocomputing"
DOI: 10.1016/j.neucom.2018.11.013
Abstract: Abstract This paper focuses on the exponential synchronization problem of complex dynamical networks (CDNs) with time-varying network topology via event-triggered communication strategy. The definition of a new time-varying network topology, called cooperatively directed spanning tree… read more here.
Keywords: event triggered; topology; directed spanning; exponential synchronization ... See more keywords
A greedy heuristic for the capacitated minimum spanning tree problem
Sign Up to like & getrecommendations! Published in 2017 at "Journal of the Operational Research Society"
DOI: 10.1057/s41274-016-0146-7
Abstract: This paper develops a greedy heuristic for the capacitated minimum spanning tree problem (CMSTP), based on the two widely known methods of Prim and of Esau–Williams. The proposed algorithm intertwines two-stages: an enhanced combination of… read more here.
Keywords: heuristic capacitated; tree problem; greedy heuristic; minimum spanning ... See more keywords
mstar – a fast parallelized algorithmically regularized integrator with minimum spanning tree coordinates
Sign Up to like & getrecommendations! Published in 2020 at "Monthly Notices of the Royal Astronomical Society"
DOI: 10.1093/mnras/staa084
Abstract: We present the novel algorithmically regularised integration method MSTAR for high accuracy ($|\Delta E/E| \gtrsim 10^{-14}$) integrations of N-body systems using minimum spanning tree coordinates. The two-fold parallelisation of the $\mathcal{O}(N_\mathrm{part}^2)$ force loops and the… read more here.
Keywords: mathrm part; tree coordinates; minimum spanning; mstar ... See more keywords
Scaling laws of chemical and Euclidean distances in critical percolation trees.
Sign Up to like & getrecommendations! Published in 2025 at "Physical review. E"
DOI: 10.1103/cthn-nh7b
Abstract: We study the scaling behavior of chemical distances in spanning trees of critical site percolation clusters. Precisely, we analyze spanning trees constructed using four different algorithms: minimal path trees (MPTs), depth-first search (DFS), right-first search… read more here.
Keywords: chemical euclidean; scaling laws; spanning tree; percolation ... See more keywords