The Filter-Kruskal Minimum Spanning Tree Algorithm

Osipov, Vitaly; Sanders, Peter; Singler, Johannes

doi:10.1137/1.9781611972894.5

Cited by 41 publications

(24 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This result is an improvement over the original FilterKruskal algorithm [32]. The expected running time for constructing the MST for arbitrary graphs with random edge weights, using the original Filter-Kruskal algorithm [32] is O(m + n log n log m/n), where m and n are the number of edges and vertices of the graph respectively.…”

Section: Introductionmentioning

confidence: 93%

See 1 more Smart Citation

Geometric Minimum Spanning Trees with GeoFilterKruskal

Chatterjee

Connor

Kumar

2010

Experimental Algorithms

View full text Add to dashboard Cite

Abstract. Let P be a set of points in R d . We propose GEOFILTERKRUSKAL, an algorithm that computes the minimum spanning tree of P using well separated pair decomposition in combination with a simple modification of Kruskal's algorithm. When P is sampled from uniform random distribution, we show that our algorithm takes one parallel sort plus a linear number of additional steps, with high probability, to compute the minimum spanning tree. Experiments show that our algorithm works better in practice for most data distributions compared to the current state of the art [31]. Our algorithm is easy to parallelize and to our knowledge, is currently the best practical algorithm on multi-core machines for d > 2.

show abstract

Section: Introductionmentioning

confidence: 93%

“…Recently, Osipov et al [32] further expanded this idea by adding a multi-core friendly filtering step designed to eliminate edges that were obviously not in the MST (Filter-Kruskal). Currently, this algorithm seems to be the most practical algorithm for computing MSTs on multi-core machines.…”

Section: Introductionmentioning

confidence: 99%

Geometric Minimum Spanning Trees with GeoFilterKruskal

Chatterjee

Connor

Kumar

2010

Experimental Algorithms

View full text Add to dashboard Cite

show abstract

“…Again the idea of graph can be applied to the colony of the mobile robots to find the shortest path. In this paper, the shortest path can be found by using the kruskal's algorithm [6]. Young, et al, [11] proposed an improved ant colony algorithm for robot path planning.…”

Section: Ant System and Shortest Path: Previous Workmentioning

confidence: 99%

Ant Colony System: An Approach for the Design of a Single Database to Establish Any Node-to-node Connectivity for Robot Path Planning in a Robot Colony

Chakraborty¹

2015

IJHIT

View full text Add to dashboard Cite

show abstract

“…An extreme simplification that still keeps the graph connected, can be obtained by Minimum Spanning Tree (MST) [3], [10] algorithms. Our approach differs from all these methods in an important aspect: we measure and allow loss of network quality, and let the user choose a suitable trade-off.…”

Section: Related Workmentioning

confidence: 99%

Network Simplification with Minimal Loss of Connectivity

Fang

Malher

Toivonen

2010

2010 IEEE International Conference on Data Mining

View full text Add to dashboard Cite

Abstract-We propose a novel problem to simplify weighted graphs by pruning least important edges from them. Simplified graphs can be used to improve visualization of a network, to extract its main structure, or as a pre-processing step for other data mining algorithms.We define a graph connectivity function based on the best paths between all pairs of nodes. Given the number of edges to be pruned, the problem is then to select a subset of edges that best maintains the overall graph connectivity. Our model is applicable to a wide range of settings, including probabilistic graphs, flow graphs and distance graphs, since the path quality function that is used to find best paths can be defined by the user. We analyze the problem, and give lower bounds for the effect of individual edge removal in the case where the path quality function has a natural recursive property. We then propose a range of algorithms and report on experimental results on real networks derived from public biological databases.The results show that a large fraction of edges can be removed quite fast and with minimal effect on the overall graph connectivity. A rough semantic analysis of the removed edges indicates that few important edges were removed, and that the proposed approach could be a valuable tool in aiding users to view or explore weighted graphs.

show abstract

The Filter-Kruskal Minimum Spanning Tree Algorithm

Cited by 41 publications

References 0 publications

Geometric Minimum Spanning Trees with GeoFilterKruskal

Geometric Minimum Spanning Trees with GeoFilterKruskal

Ant Colony System: An Approach for the Design of a Single Database to Establish Any Node-to-node Connectivity for Robot Path Planning in a Robot Colony

Network Simplification with Minimal Loss of Connectivity

Contact Info

Product

Resources

About