Pages that link to "Item:Q1218265"

The following pages link to An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees (Q1218265):

Displaying 32 items.

• A fast minimum spanning tree algorithm based on \(K\)-means (Q527132) (← links)
• An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs (Q671937) (← links)
• Huffman coding with non-sorted frequencies (Q691643) (← links)
• Polynomial testing of the query ''Is \(a^ b\geq c^ d?''\) with application to finding a minimal cost reliability ratio spanning tree (Q800816) (← links)
• Fast reoptimization for the minimum spanning tree problem (Q988691) (← links)
• Optimal one-page tree embeddings in linear time (Q1014395) (← links)
• Combinatorial optimization in system configuration design (Q1027725) (← links)
• Linear verification for spanning trees (Q1066909) (← links)
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs (Q1086246) (← links)
• A matroid algorithm and its application to the efficient solution of two optimization problems on graphs (Q1116893) (← links)
• A fast algorithm for Steiner trees (Q1145507) (← links)
• Finding minimal spanning trees in a Euclidean coordinate space (Q1154282) (← links)
• On the relationship between the biconnectivity augmentation and traveling salesman problems (Q1165162) (← links)
• An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem (Q1197938) (← links)
• An \(O(\log m)\) parallel algorithm for the minimum spanning tree problem (Q1209346) (← links)
• Priority queues with update and finding minimum spanning trees (Q1222511) (← links)
• A probabilistic minimum spanning tree algorithm (Q1241278) (← links)
• The Min-Max Spanning Tree Problem and some extensions (Q1244239) (← links)
• The stochastic bottleneck linear programming problem (Q1304778) (← links)
• The hybrid spanning tree problem (Q1333484) (← links)
• An optimal PRAM algorithm for a spanning tree on trapezoid graphs. (Q1432796) (← links)
• Optimal vertex ordering of graphs (Q1607014) (← links)
• Edge-disjoint spanning trees and the number of maximum state circles of a graph (Q1752609) (← links)
• Constrained spanning trees and the traveling salesman problem (Q1823163) (← links)
• Chance constrained bottleneck spanning tree problem (Q1896452) (← links)
• On the probabilistic min spanning tree problem (Q1935723) (← links)
• Relation-algebraic verification of Borůvka's minimum spanning tree algorithm (Q2695356) (← links)
• Use of matroid theory in operations research, circuits and systems theory (Q3898311) (← links)
• Single-Source Bottleneck Path Algorithm Faster than Sorting for Sparse Graphs. (Q5002718) (← links)
• Minimum-weight spanning tree algorithms. A survey and empirical study (Q5953166) (← links)
• An approximation algorithm for the clustered path travelling salesman problem (Q6039533) (← links)
• An approximation algorithm for the clustered path travelling salesman problem (Q6167001) (← links)