Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Minimum spanning tree-based segmentation (view), Euclidean minimum spanning tree (view), Rectilinear minimum spanning tree (view), K-minimum spanning tree (view), Random minimum spanning tree (view), Capacitated minimum spanning tree (view), Distributed minimum spanning tree (view), Kinetic Euclidean minimum spanning tree (view), Kinetic minimum spanning tree (view), Parallel algorithms for minimum spanning trees (view)

searching for Minimum spanning tree 19 found (226 total)

alternate case: minimum spanning tree

Degree-constrained spanning tree (374 words) [view diff] exact match in snippet view article find links to article

Hamiltonian path problem. On a weighted graph, a Degree-constrained minimum spanning tree (DCMST) is a degree-constrained spanning tree in which the sum of

Random tree (263 words) [view diff] exact match in snippet view article find links to article

of a graph formed by choosing random edge weights and using the minimum spanning tree for those weights Random binary tree, binary trees with various

Pavol Hell (385 words) [view diff] exact match in snippet view article find links to article

complexity of H-coloring" also with Nešetřil, "On the history of the minimum spanning tree problem", with Ron Graham, "On the completeness of a generalized

Topology control (1,164 words) [view diff] no match in snippet view article find links to article

is a basic technique in distributed algorithms. For instance, a (minimum) spanning tree is used as a backbone to reduce the cost of broadcast from O(m)

Mega-Merger (1,702 words) [view diff] exact match in snippet view article find links to article

by alliances or by conquering/absorption. Mega-Merger builds a minimum spanning tree over connected graphs provided: Total reliability: No message is

Tree spanner (472 words) [view diff] exact match in snippet view article find links to article

m} is its number of edges. A tree 1-spanner, if it exists, is a minimum spanning tree and can be found in O ( m log ⁡ β ( m , n ) ) {\displaystyle {\mathcal

Top tree (3,226 words) [view diff] exact match in snippet view article find links to article

Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity, Journal of the ACM, Vol. 48 Issue 4(July

1926 in science (1,238 words) [view diff] exact match in snippet view article find links to article

Jaroslav; Milková, Eva; Nešetřilová, Helena (2001). "Otakar Borůvka on minimum spanning tree problem: translation of both the 1926 papers, comments, history"

Pareto front (1,553 words) [view diff] exact match in snippet view article find links to article

Amadeu A. (September 2023). "On solving bi-objective constrained minimum spanning tree problems". Journal of Global Optimization. 87 (1): 301–323. doi:10

Edgar Gilbert (1,594 words) [view diff] exact match in snippet view article find links to article

conjecture on the ratio between the length of the Steiner tree and minimum spanning tree.[GP68] Although it was thought to have been proven in the early

Program structure tree (1,164 words) [view diff] exact match in snippet view article find links to article

graph algorithms, e.g., transitive closure, planarity testing, and minimum spanning tree. In particular, the authors proposed an efficient solution to the

Dependency network (2,263 words) [view diff] case mismatch in snippet view article find links to article

to construct informative sub-graph of a complete network is the Minimum Spanning Tree (MST). Another informative sub-graph, which retains more information

Yo-yo (algorithm) (924 words) [view diff] exact match in snippet view article

remaining. Gallager, Robert (1983). "A distributed algorithm for minimum spanning tree" (PDF). Massachusetts Institute of Technology. Awerbuch, Baruch

GvSIG (1,178 words) [view diff] exact match in snippet view article find links to article

analysis: network topology, stops manager, minimum path, connectivity, minimum spanning tree, origin - destination matrix, emergency / nearest facilities provider

Alan J. Hoffman (3,693 words) [view diff] exact match in snippet view article find links to article

approach. It provides a unification of results for shortest path and minimum spanning tree problems. His final paper on this topic "On greedy algorithms, partially

Baixing (2,952 words) [view diff] case mismatch in snippet view article find links to article

which states that the most connected provinces in the spatial Minimum Spanning Tree (MST) are geographically adjacent and that all clusters identified

Dynamic connectivity (3,684 words) [view diff] exact match in snippet view article find links to article

"Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity". Journal of the ACM. 48 (4): 723. doi:10

List of multiple discoveries (11,196 words) [view diff] exact match in snippet view article find links to article

flights. 1926: Borůvka's algorithm, an algorithm for finding a minimum spanning tree in a graph, was first published in 1926 by Otakar Borůvka. The algorithm

Black-American anthropology (4,757 words) [view diff] exact match in snippet view article find links to article

based on the five postcranial shape variables and its associated minimum spanning tree are shown in Figure 4.[clarification needed] Recent African groups