<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2001-03-23 05:47:08Spanning tree Mathematical optimization Complexity classes Operations research Matroid theory Travelling salesman problem Minimum spanning tree Greedy algorithm NP-complete Theoretical computer science Computational complexity theory Mathematics |
Add to Reading List |
Notes on Complexity Peter J. Cameron ii Preface | Lecture 6 Minimum Spanning Trees In this lecture, we study another classic graph problem from the distributed point of view: minimum spanning tree construction. Definition 6.1 (Minimum Spanning Tree (MST)). Given a simpDocID: 1v5jY - View Document |
| Algorithms and Data Structures Winter TermExercises for UnitConsider the Jarnik-Prim algorithm for computing a minimum spanning tree. Convince yourself that it can be implemented with Fibonacci heaps to rDocID: 1sqEk - View Document |
| Parallel Processing Letters c World Scientific Publishing Company ⃝ SOME GPU ALGORITHMS FOR GRAPH CONNECTED COMPONENTS AND SPANNING TREEDocID: 1rqFm - View Document |
| Programming Techniques S.L. Graham, R.L. Rivest EditorsDocID: 1rm4m - View Document |
| LNCSEfficient Dynamic AggregationDocID: 1rjoH - View Document |