Finding Minimum Spanning Trees
From MaRDI portal
Publication:4132283
Cited in
(66)- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
- Delay-constrained minimum shortest path trees and related problems
- Delay-constrained minimum shortest path trees and related problems
- An \(O(\log m)\) parallel algorithm for the minimum spanning tree problem
- On the Steiner ratio in 3-space
- The stochastic bottleneck linear programming problem
- Optimal vertex ordering of graphs
- Decomposable multi-parameter matroid optimization problems.
- A low arithmetic-degree algorithm for computing proximity graphs
- On the probabilistic min spanning tree problem
- There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees
- Refined complexity analysis for heap operations
- The vertex degrees of minimum spanning trees
- Steiner minimal trees in \(L^ 2_ p\)
- A pointer-free data structure for merging heaps and min-max heaps
- An improved algorithm for hierarchical clustering using strong components
- Complexity of spanning tree problems: Part I
- An optimal parallel algorithm for minimum spanning trees in planar graphs
- Efficient parallel algorithms for graph problems
- A data structure for bicategories, with application to speeding up an approximation algorithm
- An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem
- Linear verification for spanning trees
- Proximity problems for points on a rectilinear plane with rectangular obstacles
- Ranking arborescences in O(Km log n) time
- The Steiner ratio of high-dimensional Banach--Minkowski spaces.
- Stochastic bottleneck spanning tree problem
- Complexity of algorithm and operations on trees
- Computing relative neighbourhood graphs in the plane
- Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation
- On the relationship between the biconnectivity augmentation and traveling salesman problems
- Sorting helps for Voronoi diagrams
- Finding minimal spanning trees in a Euclidean coordinate space
- Percolation on complex networks: theory and application
- Risk-control approach for a bottleneck spanning tree problem with the total network reliability under uncertainty
- The Min-Max Spanning Tree Problem and some extensions
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- On symbolic OBDD-based algorithms for the minimum spanning tree problem
- On sorting, heaps, and minimum spanning trees
- On computing all north-east nearest neighbors in the \(L_ 1\) metric
- Optimal chain partitions of trees
- A fast algorithm for Steiner trees
- Finding the \(k\) smallest spanning trees
- Minimal length tree networks on the unit sphere
- A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs
- The minimum spanning tree problem on a planar graph
- A fast minimum spanning tree algorithm based on \(K\)-means
- Computational experience with minimum spanning tree algorithms
- Fast reoptimization for the minimum spanning tree problem
- Minimal spanning trees and partial sorting
- Minimum-sum dipolar spanning tree in \(\mathbb R^3\)
- Three priority queue applications revisited
- On-line updating of solutions to a class of matroid intersection problems
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
- Minimum-weight spanning tree algorithms. A survey and empirical study
- The saga of minimum spanning trees
- A linear-size zero-one programming model for the minimum spanning tree problem in planar graphs
- Weighted \({\mathcal A}\)-shape: A descriptor of the shape of a point set
- Finding the k smallest spanning trees
- A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs
- Approximation algorithms for solving the 1-line minimum Steiner tree of line segments problem
- On recursive computation of minimum spanning trees for special partial graphs
- On the restricted \(k\)-Steiner tree problem
- The 1-Steiner-Minimal-Tree problem in Minkowski-spaces
- Single-source bottleneck path algorithm faster than sorting for sparse graphs
- On the restricted 1-Steiner tree problem
- Consensus-based decision support model and fusion architecture for dynamic decision making
This page was built for publication: Finding Minimum Spanning Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4132283)
