Skip to search formSkip to main contentSkip to account menu

Reverse-delete algorithm

The reverse-delete algorithm is an algorithm in graph theory used to obtain a minimum spanning tree from a given connected, edge-weighted graph. It… 
Wikipedia (opens in a new tab)

Related topics

Related topics

12 relations
AlgorithmBorůvka's algorithmDijkstra's algorithmExpected linear time MST algorithm

Broader (1)

Spanning tree

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Multi-objective optimization of aircraft networks for weight, performance and survivability
With a current utilization of around 25% of its total weight, optimization of cabling and harness plays an important role in the… 
Review
2015
Review
2015
REVIEW : — Parallel Computing Approach of the Reverse-Delete Algorithm for finding Minimum Bottleneck Spanning Tree and Minimum Spanning Trees —
The world of computing lead people to the thinking of optimizing all the solutions, i.e. finding the best solution to a problem… 
2014
2014
Proposal of Minimum Spanning Tree Algorithm using 2-Edges Connected Grap
Abstract This paper suggests a fast minimum spanning tree algorithm which simplify the original graph to 2-edge connected graph… 
2013
2013
Linear Bottleneck Assignment Problem Based on Reverse-delete Algorithm
본 논문은 선형 병목할당 문제의 최적해를 간단히 찾는 알고리즘을 제안하였다. 일반적으로 병목할당 문제의 최적해는 한계 또는 증대경로 알고리즘으로 구한다. 제안된 알고리즘은 2… 
2013
2013
An Efficient Implementation of Kruskal`s and Reverse-Delete Minimum Spanning Tree Algorithm
This paper suggests a method to reduce the number of performances of Kruskal and Reverse-delete algorithms. Present Kruskal and… 
2012
2012
A Reverse-Delete Algorithm for Assignment Problems
2010
2010
Reverse-delete Algorithm
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)