| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652852 | Electronic Notes in Discrete Mathematics | 2007 | 8 Pages |
Abstract
This article discusses mutual relationships between solutions to some known problems. Firstly, the history of the well-known Minimum Spanning Tree Problem, including Jarník's approach to it, is briefly revisited. Secondly, the basic differences between the three classical solutions to the MST problem are discussed. Finally, algorithms solving several other graph problems, based of Jarník's approach to the solution of the MST problem, are discussed in conjunction with the properties of the Breadth-First-Search Tree and Depth-First-Search Tree.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
