Pages that link to "Item:Q4779256"
From MaRDI portal
The following pages link to On the History of the Minimum Spanning Tree Problem (Q4779256):
Displaying 50 items.
- Tight bounds for distributed minimum-weight spanning tree verification (Q372968) (← links)
- On symbolic OBDD-based algorithms for the minimum spanning tree problem (Q443706) (← links)
- The saga of minimum spanning trees (Q458468) (← links)
- Axiomatization of the Shapley value on minimum cost spanning tree games (Q700116) (← links)
- Cost monotonicity, consistency and minimum cost spanning tree games (Q705853) (← links)
- Connection situations under uncertainty and cost monotonic solutions (Q716360) (← links)
- Upper and lower bounding strategies for the generalized minimum spanning tree problem (Q817552) (← links)
- Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs (Q845678) (← links)
- Connected spatial networks over random points and a route-length statistic (Q906528) (← links)
- Computing Euclidean maximum spanning trees (Q911288) (← links)
- Optimality conditions in preference-based spanning tree problems (Q1027614) (← links)
- Fast heuristic algorithms for rectilinear Steiner trees (Q1118419) (← links)
- Farthest neighbors, maximum spanning trees and related problems in higher dimensions (Q1194310) (← links)
- An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem (Q1197938) (← links)
- A travelling salesman problem in the \(k\)-dimensional unit cube (Q1198619) (← links)
- A heuristic algorithm for the mini-max spanning forest problem (Q1278250) (← links)
- A survey of constrained classification (Q1351841) (← links)
- An effective genetic algorithm approach to the quadratic minimum spanning tree problem (Q1389197) (← links)
- The vertex degrees of minimum spanning trees (Q1580975) (← links)
- The scaling limits of the minimal spanning tree and invasion percolation in the plane (Q1621448) (← links)
- A new approach for the multiobjective minimum spanning tree (Q1651644) (← links)
- A game-theoretical and cryptographical approach to crypto-cloud computing and its economical and financial aspects (Q1703553) (← links)
- An algebraic framework for minimum spanning tree problems (Q1786562) (← links)
- The problem of the optimal biobjective spanning tree (Q1806877) (← links)
- Low-degree minimum spanning trees (Q1895968) (← links)
- Steiner minimal trees in \(L^ 2_ p\) (Q1923480) (← links)
- The weighted arborescence constraint (Q2011589) (← links)
- A greedy algorithm for finding maximum spanning trees in infinite graphs (Q2102829) (← links)
- Proof of a conjecture about minimum spanning tree cycle intersection (Q2172386) (← links)
- Percolation on complex networks: theory and application (Q2231806) (← links)
- Degree bounded bottleneck spanning trees in three dimensions (Q2292155) (← links)
- On minimum- and maximum-weight minimum spanning trees with neighborhoods (Q2344217) (← links)
- Finding outbreak trees in networks with limited information (Q2357924) (← links)
- Computing all efficient solutions of the biobjective minimum spanning tree problem (Q2384598) (← links)
- The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems (Q2399487) (← links)
- Tree index of uncertain graphs (Q2402108) (← links)
- The minimum-area spanning tree problem (Q2432736) (← links)
- Fractional interaction of financial agents in a stock market network (Q2690711) (← links)
- Relation-algebraic verification of Borůvka's minimum spanning tree algorithm (Q2695356) (← links)
- Critical random graphs and the structure of a minimum spanning tree (Q3055778) (← links)
- Multi-label Learning Through Minimum Spanning Tree-Based Subset Selection and Feature Extraction (Q3305117) (← links)
- THE MINIMUM SPANNING TREE PROBLEM: Jarník's solution in historical and present context (Q3439600) (← links)
- Spanning-Tree Games. (Q5005136) (← links)
- (Q5005188) (← links)
- Integer Programming Formulations for Minimum Spanning Tree Interdiction (Q5084609) (← links)
- Algorithms for Euclidean Degree Bounded Spanning Tree Problems (Q5197492) (← links)
- An Adaptive Minimum Spanning Tree Multielement Method for Uncertainty Quantification of Smooth and Discontinuous Responses (Q5243536) (← links)
- Hierarchies in communities of UK stock market from the perspective of Brexit (Q5861202) (← links)
- On Hop-Constrained Steiner Trees in Tree-Like Metrics (Q5864216) (← links)
- Minimum-weight spanning tree algorithms. A survey and empirical study (Q5953166) (← links)