A solution to the problem of finding an optimal spanning tree using the computer
This paper presents two algorithms in finding an optimal (minimum or maximum) spanning tree of a given weighted, simple, connected graph G on n vertices, where 1 n 10. The algorithms, which are a version of Kruskal's and Prim's algorithms combined, are coded into two programming languages...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
1991
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/15943 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |
| id |
oai:animorepository.dlsu.edu.ph:etd_bachelors-16456 |
|---|---|
| record_format |
eprints |
| spelling |
oai:animorepository.dlsu.edu.ph:etd_bachelors-164562022-08-15T01:55:09Z A solution to the problem of finding an optimal spanning tree using the computer Adriano, Jonathan Ty Labayen, Rose Jocelyn Marie Lopez This paper presents two algorithms in finding an optimal (minimum or maximum) spanning tree of a given weighted, simple, connected graph G on n vertices, where 1 n 10. The algorithms, which are a version of Kruskal's and Prim's algorithms combined, are coded into two programming languages namely CLIPPER and TURBO C. A detailed proof of the algorithm for finding a minimum spanning tree of G is provided. The researchers likewise presented a variation of Kruskal's algorithm, that is, finding optimal spanning trees with arbitrarily fixed edges. 1991-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/etd_bachelors/15943 Bachelor's Theses English Animo Repository Trees (Graph theory) Programming (Mathematics) Problem solving |
| institution |
De La Salle University |
| building |
De La Salle University Library |
| continent |
Asia |
| country |
Philippines Philippines |
| content_provider |
De La Salle University Library |
| collection |
DLSU Institutional Repository |
| language |
English |
| topic |
Trees (Graph theory) Programming (Mathematics) Problem solving |
| spellingShingle |
Trees (Graph theory) Programming (Mathematics) Problem solving Adriano, Jonathan Ty Labayen, Rose Jocelyn Marie Lopez A solution to the problem of finding an optimal spanning tree using the computer |
| description |
This paper presents two algorithms in finding an optimal (minimum or maximum) spanning tree of a given weighted, simple, connected graph G on n vertices, where 1 n 10. The algorithms, which are a version of Kruskal's and Prim's algorithms combined, are coded into two programming languages namely CLIPPER and TURBO C. A detailed proof of the algorithm for finding a minimum spanning tree of G is provided. The researchers likewise presented a variation of Kruskal's algorithm, that is, finding optimal spanning trees with arbitrarily fixed edges. |
| format |
text |
| author |
Adriano, Jonathan Ty Labayen, Rose Jocelyn Marie Lopez |
| author_facet |
Adriano, Jonathan Ty Labayen, Rose Jocelyn Marie Lopez |
| author_sort |
Adriano, Jonathan Ty |
| title |
A solution to the problem of finding an optimal spanning tree using the computer |
| title_short |
A solution to the problem of finding an optimal spanning tree using the computer |
| title_full |
A solution to the problem of finding an optimal spanning tree using the computer |
| title_fullStr |
A solution to the problem of finding an optimal spanning tree using the computer |
| title_full_unstemmed |
A solution to the problem of finding an optimal spanning tree using the computer |
| title_sort |
solution to the problem of finding an optimal spanning tree using the computer |
| publisher |
Animo Repository |
| publishDate |
1991 |
| url |
https://animorepository.dlsu.edu.ph/etd_bachelors/15943 |
| _version_ |
1772834957298761728 |