On the History of the Minimum Spanning Tree Problem
From MaRDI portal
Recommendations
Cited in
(76)- Optimality conditions in preference-based spanning tree problems
- Fast heuristic algorithms for rectilinear Steiner trees
- Farthest neighbors, maximum spanning trees and related problems in higher dimensions
- An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem
- A travelling salesman problem in the \(k\)-dimensional unit cube
- A heuristic algorithm for the mini-max spanning forest problem
- A survey of constrained classification
- An effective genetic algorithm approach to the quadratic minimum spanning tree problem
- The vertex degrees of minimum spanning trees
- The scaling limits of the minimal spanning tree and invasion percolation in the plane
- A new approach for the multiobjective minimum spanning tree
- A game-theoretical and cryptographical approach to crypto-cloud computing and its economical and financial aspects
- An algebraic framework for minimum spanning tree problems
- The problem of the optimal biobjective spanning tree
- Low-degree minimum spanning trees
- Steiner minimal trees in \(L^ 2_ p\)
- The origins of minimal spanning tree algorithms -- Borůvka and Jarník
- The weighted arborescence constraint
- A greedy algorithm for finding maximum spanning trees in infinite graphs
- Proof of a conjecture about minimum spanning tree cycle intersection
- Percolation on complex networks: theory and application
- Degree bounded bottleneck spanning trees in three dimensions
- On minimum- and maximum-weight minimum spanning trees with neighborhoods
- Finding outbreak trees in networks with limited information
- Computing all efficient solutions of the biobjective minimum spanning tree problem
- The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems
- Tree index of uncertain graphs
- The minimum-area spanning tree problem
- Fractional interaction of financial agents in a stock market network
- Relation-algebraic verification of Borůvka's minimum spanning tree algorithm
- Critical random graphs and the structure of a minimum spanning tree
- Multi-label learning through minimum spanning tree-based subset selection and feature extraction
- THE MINIMUM SPANNING TREE PROBLEM: Jarník's solution in historical and present context
- scientific article; zbMATH DE number 1260938 (Why is no real title available?)
- On symbolic OBDD-based algorithms for the minimum spanning tree problem
- The saga of minimum spanning trees
- scientific article; zbMATH DE number 2098009 (Why is no real title available?)
- scientific article; zbMATH DE number 2098016 (Why is no real title available?)
- Spanning-tree games
- Listing subgraphs by Cartesian decomposition
- Integer Programming Formulations for Minimum Spanning Tree Interdiction
- Algorithms for Euclidean degree bounded spanning tree problems
- An adaptive minimum spanning tree multielement method for uncertainty quantification of smooth and discontinuous responses
- Hierarchies in communities of UK stock market from the perspective of Brexit
- On Hop-Constrained Steiner Trees in Tree-Like Metrics
- Otakar Borůvka on minimum spanning tree problem. Translation of both the 1926 papers, comments, history
- Minimum-weight spanning tree algorithms. A survey and empirical study
- An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search
- On conflict-free spanning tree: algorithms and complexity
- Social distancing network creation
- Geometric Network Creation Games
- Models of random subtrees of a graph
- On some similarity of finite sets (and what we can say today about certain old problem)
- The Impact of Cooperation in Bilateral Network Creation
- Finding optimal spanning trees for damaged networks
- Cliometrics of world stock markets evolving networks
- Robust formation tracking for uncertain multi-agent systems with unknown leader input
- Minimum spanning trees in infinite graphs: theory and algorithms
- On minimum spanning trees for random Euclidean bipartite graphs
- On partitioning minimum spanning trees
- CoRMF: criticality-ordered recurrent mean field Ising solver
- Efficiently enumerating spanning trees of k-trees
- The complexity of power graph associated with finite p-groups
- Log-diameter MST verification and sensitivity in MPC
- Efficient search for a minimum tree in a space with the l₁-norm
- Clustering with minimum spanning trees: how good can it be?
- Axiomatization of the Shapley value on minimum cost spanning tree games
- On conflict-free spanning tree: mapping tractable and hard instances through the lenses of graph classes
- Cost monotonicity, consistency and minimum cost spanning tree games
- Connection situations under uncertainty and cost monotonic solutions
- Weight space clustering method: integrating data envelopment analysis with Monte Carlo simulation
- Upper and lower bounding strategies for the generalized minimum spanning tree problem
- Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs
- Minimum spanning trees
- Connected spatial networks over random points and a route-length statistic
- Computing Euclidean maximum spanning trees
This page was built for publication: On the History of the Minimum Spanning Tree Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4779256)
