Related papers: The Use of Minimal Spanning Trees in Particle Phys…
Based on the novel view that a micro-entity could be considered as a particle associated with a field partaking of the energy of particle which are both described by deterministic causal equations of motion, we examine the success of our…
Cosmic strings are predicted in many models beyond the Standard Model of particle physics. In models which admit strings, a network of strings will inevitably be formed in a phase transition in the early universe and will persist to the…
Many experiments and devices in physics use static magnetic fields to guide charged particles from a source onto a detector, and we ask the innocent question: What is the distribution of particle intensity over the detector surface? One…
The quadratic minimum spanning tree problem and its variations such as the quadratic bottleneck spanning tree problem, the minimum spanning tree problem with conflict pair constraints, and the bottleneck spanning tree problem with conflict…
In the length-constrained minimum spanning tree (MST) problem, we are given an $n$-node edge-weighted graph $G$ and a length constraint $h \geq 1$. Our goal is to find a spanning tree of $G$ whose diameter is at most $h$ with minimum…
Multifragmentation is the most extensively studied phenomena in this energy domain. In the past people have tried to develop various methods of clusterization[1]. Among these methods minimum spanning tree[1] is one of the fastest method. In…
We describe the conditions under which a set of continuous variables or characters can be described as an X-tree or a split network. A distance matrix corresponds exactly to a split network or a valued X-tree if, after ordering of the taxa,…
Disclosure of scaling relationship between observable quantities gives direct information about dynamics of natural phenomenon. This is the main reason why scaling plays a key role in the methodology of natural sciences. In this talk, Part…
The basics of focused transport as applied to solar energetic particles are reviewed, paying special attention to areas of common misconception. The micro-physics of charged particles interacting with slab turbulence are investigated to…
We study the distributed minimum spanning tree (MST) problem, a fundamental problem in distributed computing. It is well-known that distributed MST can be solved in $\tilde{O}(D+\sqrt{n})$ rounds in the standard CONGEST model (where $n$ is…
Minimum Spanning Tree (MST) and Breadth-First Search (BFS) tree constructions are classical problems in distributed computing, traditionally studied in the message-passing model, where static nodes communicate via messages. This paper…
We consider a family of local search algorithms for the minimum-weight spanning tree, indexed by a parameter $\rho$. One step of the local search corresponds to replacing a connected induced subgraph of the current candidate graph whose…
Given a rooted point set $P$, the rooted $y-$Monotone Minimum Spanning Tree (rooted $y-$MMST) of $P$ is the spanning geometric graph of $P$ in which all the vertices are connected to the root by some $y-$monotone path and the sum of the…
The Standard Model of Particle Physics (SMPP) is an enormously successful description of high energy physics, driving ever more precise measurements to find "physics beyond the standard model", as well as providing motivation for developing…
This paper studies constructive heuristics for the minimum labelling spanning tree (MLST) problem. The purpose is to find a spanning tree that uses edges that are as similar as possible. Given an undirected labeled connected graph (i.e.,…
Within present constraints on the observed smooth energy and its equation of state parameter, it is important to find out whether the smooth energy is static (cosmological constant) or dynamic (quintessence). The most dynamical quintessence…
The Angular Constrained Minimum Spanning Tree Problem ($\alpha$-MSTP) is defined in terms of a complete undirected graph $G=(V,E)$ and an angle $\alpha \in (0,2\pi]$. Vertices of $G$ define points in the Euclidean plane while edges, the…
The structural design of functional molecules, also called molecular optimization, is an essential chemical science and engineering task with important applications, such as drug discovery. Deep generative models and combinatorial…
We consider the minimum spanning tree (MST) problem under the restriction that for every vertex v, the edges of the tree that are adjacent to v satisfy a given family of constraints. A famous example thereof is the classical…
Neuronal dendrites form densely branched tree architectures through which mitochondria must be distributed to supply the cell's energetic needs. Dendritic mitochondria circulate through the tree, undergoing fusion and fission to form…