Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
With a current utilization of around 25% of its total weight, optimization of cabling and harness plays an important role in the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Review
2015
Review
2015
The world of computing lead people to the thinking of optimizing all the solutions, i.e. finding the best solution to a problem… Expand
Is this relevant?
2014
2014
Abstract This paper suggests a fast minimum spanning tree algorithm which simplify the original graph to 2-edge connected graph… Expand
Is this relevant?
2013
2013
본 논문은 선형 병목할당 문제의 최적해를 간단히 찾는 알고리즘을 제안하였다. 일반적으로 병목할당 문제의 최적해는 한계 또는 증대경로 알고리즘으로 구한다. 제안된 알고리즘은 2… Expand
Is this relevant?
2013
2013
This paper suggests a method to reduce the number of performances of Kruskal and Reverse-delete algorithms. Present Kruskal and… Expand
Is this relevant?
2012
2012
 
Is this relevant?
2010
2010
 
Is this relevant?