Expected linear time MST algorithm: Difference between revisions

Revision as of 09:24, 16 April 2012

Revision as of 09:25, 16 April 2012

Line 11:

| title = A randomized linear-time algorithm to find minimum spanning trees

| volume = 42

| year = 1995}}</ref>. The algorithm relies on techniques from [[Borůvka's algorithm]] along with an algorithm for [[MST verification algorithm|verifying a minimum spanning tree in [[linear time]]

<ref name=MST-V1>{{cite journal

| last1 = Dixon | first1 = Brandon