Results 141 to 150 of about 128,039 (188)

A multi layered encryption framework using intuitionistic fuzzy graphs and graph theoretic domination for secure communication networks. [PDF]

Sci Rep
Meenakshi A, Dhanushiya S, Mrsic L, Kalampakas A, Samanta S.   +4 more
europepmc   +1 more source

The generalized minimum spanning tree problem

, 2002
openaire   +1 more source

Somatic and germline mutational processes across the tree of life

Campbell P, Lee S, Wang Y, Haynes H, Mitchell E, Maddison M, Crowley L, Adkins P, Mieszkowska N, Blaxter M, Durbin R.   +10 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Minimum-loss network reconfiguration: A minimum spanning tree problem

Sustainable Energy, Grids and Networks, 2015
Abstract Topological reconfiguration of power distribution systems can result in operational savings by reducing the power losses in the network. In this paper, an efficient heuristic is proposed to find an initial solution for the minimum-loss reconfiguration problem with small optimality gap.
Hamed Ahmadi, José R. Martí
openaire   +3 more sources

The Minimum Centroid Branch Spanning Tree Problem

Journal of the Operations Research Society of China, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lin, Hao, He, Cheng
openaire   +1 more source

Solving the Quadratic Minimum Spanning Tree Problem

Applied Mathematics and Computation, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
R. Cordone, G. Passeri
openaire   +3 more sources

Minimum Diameter Spanning Trees and Related Problems

SIAM Journal on Computing, 1991
The diameter of spanning tree is the maximum distance between any two points in the tree. A characterization of the problem of finding a minimum diameter spanning tree of a set of \(n\) points in the Euclidean spaces is given and a \(\theta (n^ 3)\) time algorithm for solving it is presented.
Ho, Jan-Ming, Lee, D. T., Chang, Chia-Hsiang, Wong, C. K.   +3 more
openaire   +1 more source

The constrained minimum spanning tree problem

1996
Given an undirected graph with two different nonnegative costs associated with every edge e (say, we for the weight and l e for the length of edge e) and a budget L, consider the problem of finding a spanning tree of total edge length at most L and minimum total weight under this restriction.
Ramamoorthi Ravi, M. X. Goemans
openaire   +1 more source

Fuzzy quadratic minimum spanning tree problem

Applied Mathematics and Computation, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gao, Jinwu, Lu, Mei
openaire   +2 more sources